Abstract
We propose a Late Acceptance Hill-Climbing (LAHC) approach to solve the unrelated parallel machine scheduling problem with sequence and machine-dependent setup times. LAHC is an iterative list-based single-parameter metaheuristic that exploits information from one iteration to another to decide whether the new candidate solution is accepted. A dynamic job insertion heuristic is used to generate initial solutions. Three local search operators (job swap between different machines, job swap within the same machine and job insertion from one machine to another) are used to improve solutions. A Variable Neighborhood Descent (VND) method is proposed to improve the candidate solution and accelerate the convergence of the LAHC. To the best of our knowledge, this is the first application of LAHC to parallel machine scheduling problems. We evaluate and compare the proposed algorithm against the best methods from the literature. Having a single parameter which makes it simpler than all existing approaches, the proposed method outperforms existing methods on most of the tested benchmark instances.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Allahverdi, A.: The third comprehensive survey on scheduling problems with setup times/costs. Eur. J. Oper. Res. 246(2), 345–378 (2015)
Arnaout, J.-P., Musa, R., Rabadi, G.: A two-stage ant colony optimization algorithm to minimize the makespan on unrelated parallel machines-Part II: enhancements and experimentations. J. Intell. Manuf. 25(1), 43–53 (2014)
Arnaout, J.-P., Rabadi, G., Musa, R.: A two-stage ant colony optimization algorithm to minimize the makespan on unrelated parallel machines with sequence-dependent setup times. J. Intell. Manuf. 21(6), 693–701 (2010)
Burke, E.K., Bykov, Y.: The late acceptance hill-climbing heuristic. Computing Science and Mathematics, University of Stirling, Technical report No. CSM-192 (2012)
Diana, R.O.M., de França Filho, M.F., de Souza, S.R., de Almeida Vitor, J.F.: An immune-inspired algorithm for an unrelated parallel machines’ scheduling problem with sequence and machine dependent setup-times for makespan minimisation. Neurocomputing 163, 94–105 (2015)
Fanjul-Peyro, L., Ruiz, R., Perea, F.: Reformulations and an exact algorithm for unrelated parallel machine scheduling problems with setup times. Comput. Oper. Res. 101, 173–182 (2019)
Helal, M., Rabadi, G., Al-Salem, A.: A tabu search algorithm to minimize the makespan for the unrelated parallel machines scheduling problem with setup times. Int. J. Oper. Res. 3(3), 182–192 (2006)
Kurz, M.E., Askin, R.G.: Heuristic scheduling of parallel machines with sequence-dependent set-up times. Int. J. Prod. Res. 39(16), 3747–3769 (2001)
Lee, Y.H., Pinedo, M.: Scheduling jobs on parallel machines with sequence-dependent setup times. Eur. J. Oper. Res. 100(3), 464–474 (1997)
Martello, S., Soumis, F., Toth, P.: Exact and approximation algorithms for makespan minimization on unrelated parallel machines. Discrete Appl. Math. 75(2), 169–188 (1997)
Na, D.-G., Kim, D.-W., Jang, W., Chen, F.F.: Scheduling unrelated parallel machines to minimize total weighted tardiness. In: 2006 IEEE International Conference on Service Operations and Logistics, and Informatics, pp. 758–763. IEEE (2006)
Rabadi, G., Moraga, R.J., Al-Salem, A.: Heuristics for the unrelated parallel machine scheduling problem with setup times. J. Intell. Manuf. 17(1), 85–97 (2006)
Shim, S.-O., Kim, Y.-D.: A branch and bound algorithm for an identical parallel machine scheduling problem with a job splitting property. Comput. Oper. Res. 35(3), 863–875 (2008)
Talbi, E.-G.: Metaheuristics: From Design to Implementation, vol. 74. Wiley, Hoboken (2009)
Tran, T.T., Araujo, A., Beck, J.C.: Decomposition methods for the parallel machine scheduling problem with setups. INFORMS J. Comput. 28(1), 83–95 (2016)
Vallada, E., Ruiz, R.: A genetic algorithm for the unrelated parallel machine scheduling problem with sequence dependent setup times. Eur. J. Oper. Res. 211(3), 612–622 (2011)
Ying, K.-C., Lee, Z.-J., Lin, S.-W.: Makespan minimization for scheduling unrelated parallel machines with setup times. J. Intell. Manuf. 23(5), 1795–1803 (2012)
Acknowledgments
This research has been funded by a grant from Aube French Department and Troyes Champagne Metropole (TCM).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Terzi, M., Arbaoui, T., Yalaoui, F., Benatchba, K. (2020). Solving the Unrelated Parallel Machine Scheduling Problem with Setups Using Late Acceptance Hill Climbing. In: Nguyen, N., Jearanaitanakij, K., Selamat, A., Trawiński, B., Chittayasothorn, S. (eds) Intelligent Information and Database Systems. ACIIDS 2020. Lecture Notes in Computer Science(), vol 12033. Springer, Cham. https://doi.org/10.1007/978-3-030-41964-6_22
Download citation
DOI: https://doi.org/10.1007/978-3-030-41964-6_22
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-41963-9
Online ISBN: 978-3-030-41964-6
eBook Packages: Computer ScienceComputer Science (R0)