Iterative job splitting algorithms for parallel machine scheduling with job splitting and setup resource constraints

Author(s):  
Jun-Ho Lee ◽  
Hoon Jang ◽  
Hyun-Jung Kim
2018 ◽  
Vol 20 (4) ◽  
pp. 2109-2132 ◽  
Author(s):  
Mohamed Amine Abdeljaoued ◽  
Nour El Houda Saadani ◽  
Zied Bahroun

2019 ◽  
Vol 11 (24) ◽  
pp. 7137 ◽  
Author(s):  
Jun-Ho Lee ◽  
Hoon Jang

We examine a uniform parallel machine scheduling problem with dedicated machines, job splitting, and limited setup resources for makespan minimization. In this problem, machines have different processing speeds, and each job can only be processed at several designated machines. A job can be split into multiple sections and those sections can be processed on multiple machines simultaneously. Sequence-independent setup times are assumed, and setup operations between jobs require setup operators that are limited. For the problem, we first develop a mathematical optimization model and for large-sized problems a constructive heuristic algorithm is proposed. Finally, we show that the algorithm developed is efficient and provides good solutions by experiments with various scenarios.


2004 ◽  
Vol 42 (21) ◽  
pp. 4531-4546 ◽  
Author(s):  
Y.-D. Kim * ◽  
S.-O. Shim ◽  
S.-B. Kim ◽  
Y.-C. Choi ◽  
H. M. Yoon

Sign in / Sign up

Export Citation Format

Share Document