Search Results - subject:"Identical parallel machines"

A branch and bound algorithm to minimize total tardiness of jobs in a two identical-parallel-machine scheduling problem with a machine availability constraint

Lee, Ju-Yong; Kim, Yeong-Dae - In: Journal of the Operational Research Society : OR 66 (2015) 9, pp. 1542-1554

Persistent link: https://www.econbiz.de/10011417478

A note on the Coffman-Sethi bound for LPT scheduling

Blocher, James D.; Sevastyanov, Sergey - In: Journal of scheduling 18 (2015) 3, pp. 325-327

Persistent link: https://www.econbiz.de/10011290702

Scheduling with multi-attribute setup times on two identical parallel machines

Lee, Cheng-Hsiung; Liao, Ching-Jong; Chung, Tsui-Ping - In: International Journal of Production Economics 153 (2014) C, pp. 130-138

machine. The problem can be classified as a scheduling problem to minimize the makespan on two identical parallel machines …

Persistent link: https://www.econbiz.de/10010776686

Scheduling with multi-attribute setup times on two identical parallel machines

Lee, Cheng-hsiung; Liao, Ching-jong; Chung, Tsui-ping - In: International journal of production economics 153 (2014), pp. 130-138

Persistent link: https://www.econbiz.de/10010385251

Robust makespan minimisation in identical parallel machine scheduling problem with interval data

Xu, Xiaoqing; Cui, Wentian; Lin, Jun; Qian, Yanjun - In: International journal of production research 51 (2013) 12, pp. 3532-3548

Persistent link: https://www.econbiz.de/10009775795

Scheduling jobs on identical parallel machines with unequal future ready time and sequence dependent setup: An experimental study

Xi, Yue; Jang, Jaejin - In: International Journal of Production Economics 137 (2012) 1, pp. 1-10

total weighted tardiness on identical parallel machines with unequal future ready time and sequence dependent setup. …

Persistent link: https://www.econbiz.de/10010572531

Scheduling jobs on identical parallel machines with unequal future ready time and sequence dependent setup : an experimental study

Xi, Yue; Jang, Jaejin - In: International journal of production economics 137 (2012) 1, pp. 1-10

Persistent link: https://www.econbiz.de/10009526100

Comparing the minimum completion times of two longest-first scheduling-heuristics

Walter, Rico - Wirtschaftswissenschaftliche Fakultät, … - 2010

For the basic problem of non-preemptively scheduling n independent jobs on m identical parallel machines so that the …

Persistent link: https://www.econbiz.de/10008695050

Time complexity of single- and identical parallel-machine scheduling with GERT network precedence constraints

Zimmermann, Jürgen - In: Computational Statistics 49 (1999) 2, pp. 221-238

In this paper we deal with the time complexity of single- and identical parallel-machine scheduling problems in which the durations and precedence constraints of the activities are stochastic. The stochastic precedence constraints are given by GERT networks. First, we sketch the basic concepts...

Persistent link: https://www.econbiz.de/10010847547

Time complexity of single- and identical parallel-machine scheduling with GERT network precedence constraints

Zimmermann, Jürgen - In: Mathematical Methods of Operations Research 49 (1999) 2, pp. 221-238

Persistent link: https://www.econbiz.de/10010999597