Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Blazewicz, J., Drozdowski, M., Formanowicz, P., Kubiak, W., & Schmidt, G. (2000). Scheduling preemptable tasks on parallel processors with limited availability. Parallel Computing, 26(9), 1195–1211.
Demir, R., & Vizvári, B. (1995). A column generation algorithm to schedule identical parallel machines. Pure Mathematics and Applications, 6, 287–299.
Graham, R. (1969). Bounds on multiprocessing timing anomalies. SIAM Journal on Applied Mathematics, 17, 416–429.
Graham, R., Lawer, E., Lenstra, J., & Rinnooy Ken, A. (1979). Optimization and approximation in deterministic sequencing and scheduling. Annals of Discrete Mathematics, 5, 287–326.
Hashemian, N. (2010). Makespan minimization for parallel machines scheduling with availability constraints. Master’s thesis, Dalhousie University.
Ho, J., & Wong, J. (1995). Makespan minimization for m parallel identical processors. Naval Research Logistics, 42, 935–948.
Kellereer, H. (1998). Algorithms for multiprocessor scheduling with machine release times. IIE Transactions, 30, 991–999.
Lee, C.-Y. (1991). Parallel machines scheduling with nonsimultaneous machine available time. Discrete Applied Mathematics, 30, 53–61.
Lee, C.-Y. (1996). Machine scheduling with an availability constraint. Journal of Global Optimization, 9, 395–416.
Lee, C.-Y., Lei, L., & Pinedo, M. (1997). Current trends in deterministic scheduling. Annals of Operations Research, 70, 1–41.
Liao, C., Shyur, D., & Lin, C. (2005). Makespan minimization for two parallel machines with an availability constraint. European Journal of Operational Research, 160, 445–456.
Liao, L.-W., & Sheen, G.-J. (2008). Parallel machine scheduling with machine availability and eligibility constraints. European Journal of Operational Research, 184(2), 458–467.
Lin, G., He, Y., Yao, Y., & Lu, H. (1997). Exact bounds of the modified lpt algorithms applying to parallel machines scheduling with nonsimultaneous machine available times. Applied Mathematics. A Journal of Chinese Universities, 12, 109–116.
Ma, Y., Chu, C., & Zuo, C. (2010). A survey of scheduling with deterministic machine availability constraints. Computers & Industrial Engineering, 58(2), 199–211.
Schmidt, G. (2000). Scheduling with limited machine availability. European Journal of Operational Research, 121(1), 1–15.
Acknowledgements
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.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Hashemian, N., Diallo, C. & Vizvári, B. Makespan minimization for parallel machines scheduling with multiple availability constraints. Ann Oper Res 213, 173–186 (2014). https://doi.org/10.1007/s10479-012-1059-8
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-012-1059-8