Výsledky vyhledávání - "binary-integer programming model"
-
1
Minimizing earliness and tardiness subject to total completion time in an identical parallel machine system
ISSN: 0305-0548, 1873-765X, 0305-0548Vydáno: Kidlington Elsevier Ltd 01.02.2009Vydáno v Computers & operations research (01.02.2009)“… A streamlined binary integer programming model is developed to solve the P ∥ C max / ∑ C i problem and the P ∥ ( E + T ) / ∑ C i problem…”
Získat plný text
Journal Article -
2
Optimizing urban rail timetable under time-dependent demand and oversaturated conditions
ISSN: 0968-090X, 1879-2359Vydáno: Kidlington Elsevier India Pvt Ltd 01.11.2013Vydáno v Transportation research. Part C, Emerging technologies (01.11.2013)“… A binary integer programming model incorporated with passenger loading and departure events is constructed to provide a theoretic description for the problem…”
Získat plný text
Journal Article -
3
Minimizing makespan subject to minimum total absolute deviation of completion time on identical parallel machines
ISSN: 0305-215X, 1029-0273Vydáno: Abingdon Taylor & Francis 01.10.2012Vydáno v Engineering optimization (01.10.2012)“…). An optimization algorithm is first proposed to solve TADC on an identical parallel machine and an iterative procedure based on a polynomial binary integer programming model is then proposed to minimize makespan…”
Získat plný text
Journal Article -
4
Noise-safe job rotation in multi-workday scheduling considering skill and demand requirements
ISSN: 2168-1015, 2168-1023Vydáno: Abingdon Taylor & Francis 17.11.2021Vydáno v Journal of Industrial and Production Engineering (17.11.2021)“… The proposed model is formulated as a binary integer programming model with labor cost minimization…”
Získat plný text
Journal Article -
5
Location-coverage models for preventing attacks on interurban transportation networks
ISSN: 0254-5330, 1572-9338Vydáno: New York Springer US 01.11.2017Vydáno v Annals of operations research (01.11.2017)“… In an attempt to solve this problem, a binary integer programming model is developed, whose objective is to maximize the expected vehicle coverage across the network…”
Získat plný text
Journal Article -
6
Optimization models for the tool change scheduling problem
ISSN: 0305-0483, 1873-5274Vydáno: Exeter Elsevier Ltd 01.10.2008Vydáno v Omega (Oxford) (01.10.2008)“… In this paper, we examine this problem to minimize the total tardiness of jobs. Two mixed binary integer programming models are developed to optimally solve this problem…”
Získat plný text
Journal Article -
7
Minimizing maximum tardiness in single FMS machine scheduling with tool changes
ISSN: 0252-2667, 2169-0103Vydáno: Delhi Taylor & Francis Group 01.11.2009Vydáno v Journal of information & optimization sciences (01.11.2009)“… Two mixed binary integer programming models were developed to solve this problem optimally…”
Získat plný text
Journal Article