Abstract
In this paper, an NP-hard parallel machine scheduling problem under resource reservation constraints is studied. The problem is characterized by a set of operations that have to be scheduled on parallel machines, given that the process of each operation requires one specific additional resource, present in a single copy, from a set of reusable resources. The objective is to minimize the makespan. After a mathematical formulation of the problem, two new heuristics that quickly reach a satisfying solution and a simulated annealing metaheuristic aiming to improve the solutions’ quality are provided. The performance of these methods is assessed in a detailed experimental study that includes a comparison with three heuristics from the literature and a worst case analysis of the best performing heuristic. The obtained results show that one of our heuristics outperforms the literature’s methods for nearly all the tested instances, while the simulated annealing algorithm improves the heuristics’ outcomes and ensure near optimal solutions in most of the tests.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Agnetis A, Flamini M, Nicosia G, Pacifici A (2011) A job-shop problem with one additional resource type. J Sched 14(3):225–237
Blazewicz J, Lenstra JK, Kan AHGR (1983) Scheduling subject to resource constraints: classification and complexity. Discr Appl Math 5(1):11–24. https://doi.org/10.1016/0166-218X(83)90012-4
Blazewicz J, Kubiak W, Röck H, Szwarcfiter J (1987) Minimizing mean flow time with parallel processors and resource constraints. Acta Informatica 24(5):513–524
Błazewicz J, Kubiak W, Martello S (1993) Algorithms for minimizing maximum lateness with unit length tasks and resource constraints. Discr Appl Math 42(2–3):123–138. https://doi.org/10.1016/0166-218X(93)90042-M
Bräsel H, Herms A, Mörig M, Tautenhahn T, Tusch J, Werner F (2008) Heuristic constructive algorithms for open shop scheduling to minimize mean flow time. Eur J Oper Res 189(3):856–870. https://doi.org/10.1016/j.ejor.2007.02.057
Cappadonna FA, Costa A, Fichera S (2013) Makespan minimization of unrelated parallel machines with limited human resources. Procedia CIRP 12:450–455. https://doi.org/10.1016/j.procir.2013.09.077
Celano G, Costa A, Fichera S (2008) Scheduling of unrelated parallel manufacturing cells with limited human resources. Int J Prod Res 46(2):405–427
Daniels RL, Hoopes BJ, Mazzola JB (1996) Scheduling parallel manufacturing cells with resource flexibility. Manag Sci 42(9):1260–1276. https://doi.org/10.1287/mnsc.42.9.1260
Dorndorf U, Pesch E, Phan-Huy T (2001) Solving the open shop scheduling problem. J Sched 4(3):157–174. https://doi.org/10.1002/jos.73
Edis EB, Oguz C, Ozkarahan I (2013) Parallel machine scheduling with additional resources: notation, classification, models and solution methods. Eur J Oper Res 230(3):449–463. https://doi.org/10.1016/j.ejor.2013.02.042
Eglese RW (1990) Simulated annealing: a tool for operational research. Eur J Oper Res 46:271–281
Fawcett T (2006) An introduction to ROC analysis. Pattern Recogn Lett 27:861–874
Grigoriev A, Sviridenko M, Uetz M (2005) Unrelated parallel machine scheduling with resource dependent processing times. In: Junger M, Kaibel V (eds) Integer programming and combinatorial optimization. Springer, Berlin, pp 182–195
Guinet A, Saadani NEH (2010) Nomadisme chirurgical et ordonnancement de blocs opératoires. In: Proceeding of Conférence francophone en Gestion et Ingénierie des Systèmes Hospitaliers. GISEH, Clermont-Ferrand, France
Herrmann J, Proth J, Sauer N (1997) Heuristics for unrelated machine scheduling with precedence constraints. Eur J Oper Res 102(3):528–537. https://doi.org/10.1016/S0377-2217(96)00247-0
Kellerer H, Strusevich VA (2003) Scheduling problems for parallel dedicated machines under multiple resource constraints. Discr Appl Math 133(1–3):45–68. https://doi.org/10.1016/S0166-218X(03)00433-5
Kravchenko SA, Werner F (2011) Parallel machine problems with equal processing times: a survey. J Sched 14(5):435–444. https://doi.org/10.1007/s10951-011-0231-3
Lee K, Leung JYT, Pinedo ML (2010) Makespan minimization in online scheduling with machine eligibility. 4OR-Q J Oper Res 8(4):331–364. https://doi.org/10.1007/s10288-010-0149-1
Lenstra JK, Rinnooy Kan AHG, Brucker P (1977) Complexity of machine scheduling problems. Ann Discret Math 1:343–362. https://doi.org/10.1016/s0167-5060(08)70743-x
Li K, Shi Y, Yang S, Cheng B (2011) Parallel machine scheduling problem to minimize the makespan with resource dependent processing times. Appl Soft Comput 11(8):5551–5557. https://doi.org/10.1016/j.asoc.2011.05.005
Lin Y, Hsieh F (2014) Unrelated parallel machine scheduling with setup times and ready times. Int J Prod Res 52(4):1200–1214. https://doi.org/10.1080/00207543.2013.848305
McNaughton R (1959) Scheduling with deadlines and loss functions. Manag Sci 6(1):1–12. https://doi.org/10.1287/mnsc.6.1.1
Mensendiek A, Gupta JND, Herrmann J (2015) Scheduling identical parallel machines with fixed delivery dates to minimize total tardiness. Eur J Oper Res 243(2):514–522. https://doi.org/10.1016/j.ejor.2014.12.002
Mokotoff E (2001) Parallel machine scheduling problems: a survey. Asia Pac J Oper Res 18:193–242
Naderi B, Ghomi FSMT, Aminnayeri M, Zandieh M (2010) A contribution and new heuristics for open-shop scheduling. Comput Oper Res 37:213–221
Nawaz M, Enscore EE, Ham I (1983) A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. Omega 11(1):91–95. https://doi.org/10.1016/0305-0483(83)90088-9
Peterkofsky RI, Daganzo CF (1990) A branch and bound solution method for the crane scheduling problem. Transp Res Part B Methodol 24(3):159–172. https://doi.org/10.1016/0191-2615(90)90014-P
Pfund M, Fowler JW, Gupta JND (2004) Multi-objective unrelated parallel machine deterministic scheduling problems. J Chin Inst Ind Eng 21(3):230–241. https://doi.org/10.1080/10170660409509404
Ruiz-Torres AJ, López FJ, Ho JC (2007) Scheduling uniform parallel machines subject to a secondary resource to minimize the number of tardy jobs. Eur J Oper Res 179(2):302–315. https://doi.org/10.1016/j.ejor.2006.03.028
Ventura JA, Kim D (2003) Parallel machine scheduling with earliness–tardiness penalties and additional resource constraints. Comput Oper Res 30(13):1945–1958. https://doi.org/10.1016/S0305-0548(02)00118-1
Yeh W, Chuang M, Lee W (2015) Uniform parallel machine scheduling with resource consumption constraint. Appl Math Model 39(8):2131–2138. https://doi.org/10.1016/j.apm.2014.10.012
Zhang L, Lu L (2016) Parallel-machine scheduling with release dates and rejection. 4OR-Q J Oper Res 14(2):165–172. https://doi.org/10.1007/s10288-016-0304-4
Zhong X, Ou J (2016) Improved approximation algorithms for parallel machine scheduling with release dates and job rejection. 4OR-Q J Oper Res. https://doi.org/10.1007/s10288-016-0339-6
Acknowledgements
The authors are grateful to the reviewers for their careful reading of the paper and their valuable feedback.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Abdeljaoued, M.A., Saadani, N.E.H. & Bahroun, Z. Heuristic and metaheuristic approaches for parallel machine scheduling under resource constraints. Oper Res Int J 20, 2109–2132 (2020). https://doi.org/10.1007/s12351-018-0412-3
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12351-018-0412-3