Makespan minimization for parallel machines scheduling with multiple availability constraints
- 632 Downloads
The problem of makespan minimization for parallel machines scheduling with multiple planned nonavailability periods in the case of resumable jobs is considered. In the current state of the literature, there is a limited number of models and algorithms dealing with this problem and only for very small problem size, and nonavailability limited to some machines. The problem is first formulated as a mixed integer linear programming model and optimally solved using CPLEX for small to moderately large size problems with multiple availability constraints on all machines. An implicit enumeration algorithm using the lexicographic order is then designed to solve large-scale problems. Numerical results are obtained for several experiments and they show the validity and performance improvements procured by both the MILP model and the new enumeration algorithm.
KeywordsParallel machines Availability constraints Makespan Scheduling
The authors would like to thank the anonymous referees, the editors and Dr. Eldon Gunn for their useful comments and suggestions. This research work was supported by the Natural Sciences and Engineering Research Council of Canada (NSERC) under Grant 356664–2008.
- Demir, R., & Vizvári, B. (1995). A column generation algorithm to schedule identical parallel machines. Pure Mathematics and Applications, 6, 287–299. Google Scholar
- Hashemian, N. (2010). Makespan minimization for parallel machines scheduling with availability constraints. Master’s thesis, Dalhousie University. Google Scholar
- Kellereer, H. (1998). Algorithms for multiprocessor scheduling with machine release times. IIE Transactions, 30, 991–999. Google Scholar