Makespan minimization of multi-slot just-in-time scheduling on single and parallel machines

2009 ◽  
Vol 13 (5) ◽  
pp. 479-492 ◽  
Author(s):  
Dariusz Dereniowski ◽  
Wiesław Kubiak
1991 ◽  
Vol 2 (4) ◽  
pp. 253-260 ◽  
Author(s):  
Manuel Laguna ◽  
Jos� Luis Gonz�lez Velarde

2009 ◽  
Vol 19 (3) ◽  
pp. 347-368 ◽  
Author(s):  
Yaron Leyvand ◽  
Dvir Shabtay ◽  
George Steiner ◽  
Liron Yedidsion

Omega ◽  
2016 ◽  
Vol 63 ◽  
pp. 41-47 ◽  
Author(s):  
Yunqiang Yin ◽  
Shuenn-Ren Cheng ◽  
T.C.E. Cheng ◽  
Du-Juan Wang ◽  
Chin-Chia Wu

2020 ◽  
Vol 40 (4) ◽  
pp. 876-900
Author(s):  
Rico Walter ◽  
Alexander Lawrinenko

Abstract The paper on hand approaches the classical makespan minimization problem on identical parallel machines from a rather theoretical point of view. Using an approach similar to the idea behind inverse optimization, we identify a general structural pattern of optimal multiprocessor schedules. We also show how to derive new dominance rules from the characteristics of optimal solutions. Results of our computational study attest to the efficacy of the new rules. They are particularly useful in limiting the search space when each machine processes only a few jobs on average.


Sign in / Sign up

Export Citation Format

Share Document