Abstract
Scheduling has an immense effect on various areas of human lives, be it though its application in manufacturing and production industry, transportation, workforce allocation, or others. The unrelated parallel machines scheduling problem (UPMSP), which is one of the various problem types that exist, found its application in many areas like manufacturing and distributed computing. Due to the complexity of the problem, heuristic and metaheuristic methods have dominantly been applied for solving it. Although this problem variant did not receive much attention as other models, recent years saw the increase of research dealing with the UPMSP. During that time, different problem variants, solution methods, and interesting research directions were considered. However, no study provided a systematic overview of the research in which heuristic methods are applied for solving the UPMSP. This comes as a problem since it is becoming difficult to keep track of all the relevant research directions and solution methods considered for this problem. Therefore, the goal of this study is to provide an extensive literature review on the application of heuristic and metaheuristic methods for solving the UPMSP. Each reviewed study is briefly described based on the considered problem and solution method. Additionally, studies dealing with similar problems are grouped together to outline the evolution of the research, and possible areas where further research can be carried out. All studies were systematised and classified into several categories to allow for an easy overview of different problem and solution variants. Finally, recent research trends and possible future directions are also outlined.
Similar content being viewed by others
Availability of data and material
Not applicable
Code availability
Not applicable
References
Abedi M, Seidgar H, Fazlollahtabar H (2017) Hybrid scheduling and maintenance problem using artificial neural network based meta-heuristics. J Model Manag 12(3):525–550. https://doi.org/10.1108/JM2-02-2016-0011
Afzalirad M, Rezaeian J (2016) Design of high-performing hybrid meta-heuristics for unrelated parallel machine scheduling with machine eligibility and precedence constraints. Eng Optim 48(4):706–726. https://doi.org/10.1080/0305215X.2015.1042475
Afzalirad M, Rezaeian J (2016) Resource-constrained unrelated parallel machine scheduling problem with sequence dependent setup times, precedence constraints and machine eligibility restrictions. Comput Ind Eng 98:40–52. https://doi.org/10.1016/j.cie.2016.05.020
Afzalirad M, Rezaeian J (2017) A realistic variant of bi-objective unrelated parallel machine scheduling problem: Nsga-ii and moaco approaches. Appl Soft Comput 50:109–123. https://doi.org/10.1016/j.asoc.2016.10.039
Afzalirad M, Shafipour M (2015) Design of an efficient genetic algorithm for resource-constrained unrelated parallel machine scheduling problem with machine eligibility restrictions. J Intell Manuf 29(2):423–437. https://doi.org/10.1007/s10845-015-1117-6
Ahemad M, Shrivastava R (2013) Green manufacturing (gm): past, present and future(a state of art review). World Rev Sci 10:17–55. https://doi.org/10.1504/WRSTSD.2013.050784
Akbar M, Irohara T (2018) Scheduling for sustainable manufacturing: a review. J Clean Prod 205:866–883. https://doi.org/10.1016/j.jclepro.2018.09.100
Al-harkan IM, Qamhan AA (2019) Optimize unrelated parallel machines scheduling problems with multiple limited additional resources, sequence-dependent setup times and release date constraints. IEEE Access 7:171533–171547. https://doi.org/10.1109/ACCESS.2019.2955975
Al-harkan IM, Qamhan AA, Badwelan A, Alsamhan A, Hidri L (2021) Modified harmony search algorithm for resource-constrained parallel machine scheduling problem with release dates and sequence-dependent setup times. Processes. https://doi.org/10.3390/pr9040654
Allahverdi A (2015) The third comprehensive survey on scheduling problems with setup times/costs. Eur J Oper Res 246(2):345–378. https://doi.org/10.1016/j.ejor.2015.04.004
Allahverdi A (2016) A survey of scheduling problems with no-wait in process. Eur J Oper Res 255(3):665–686. https://doi.org/10.1016/j.ejor.2016.05.036
Allahverdi A, Gupta JN, Aldowaisan T (1999) A review of scheduling research involving setup considerations. Omega 27(2):219–239. https://doi.org/10.1016/S0305-0483(98)00042-5
Allahverdi A, Ng C, Cheng T, Kovalyov MY (2008) A survey of scheduling problems with setup times or costs. Eur J Oper Res 187(3):985–1032. https://doi.org/10.1016/j.ejor.2006.06.060
Al-qaness MAA, Ewees AA, Elaziz MA (2021) Modified whale optimization algorithm for solving unrelated parallel machine scheduling problems. Soft Comput 25(14):9545–9557. https://doi.org/10.1007/s00500-021-05889-w
Al-Salem A, Armacost R (2002) Unrelated machines scheduling with machine eligibility restrictions. 15:193–210
Anagnostopoulos G, Rabadi G (2002) A simulated annealing algorithm for the unrelated parallel machine scheduling problem. In: Proceedings of the 5th biannual world automation congress, vol 14, pp 115–120. https://doi.org/10.1109/WAC.2002.1049430
Arık OA (2019) Comparisons of metaheuristic algorithms for unrelated parallel machine weighted earliness/tardiness scheduling problems. Evolut Intell 13(3):415–425. https://doi.org/10.1007/s12065-019-00305-7
Arnaout J-P, Musa R, Rabadi G (2008) Ant colony optimization algorithm to parallel machine scheduling problem with setups. In: 2008 IEEE international conference on automation science and engineering, pp 578–582. https://doi.org/10.1109/COASE.2008.4626566
Arnaout J-PM, Rabadi G, Mun JH (2006) A dynamic heuristic for the stochastic unrelated parallel machine scheduling problem
Arnaout J-P, Rabadi G (2005) Minimizing the total weighted completion time on unrelated parallel machines with stochastic times. In: Proceedings of the winter simulation conference, 2005. https://doi.org/10.1109/WSC.2005.1574499
Arnaout J-P (2019) A worm optimization algorithm to minimize the makespan on unrelated parallel machines with sequence-dependent setup times. Ann Oper Res 285(1–2):273–293. https://doi.org/10.1007/s10479-019-03138-w
Arnaout J-P, Rabadi G, Musa R (2009) 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. https://doi.org/10.1007/s10845-009-0246-1
Arnaout J-P, Musa R, Rabadi G (2012) 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. https://doi.org/10.1007/s10845-012-0672-3
Arroyo JEC, Leung JY-T (2017) An effective iterated greedy algorithm for scheduling unrelated parallel batch machines with non-identical capacities and unequal ready times. Comput Ind Eng 105:84–100. https://doi.org/10.1016/j.cie.2016.12.038
Arroyo JEC, Leung JY-T (2017) Scheduling unrelated parallel batch processing machines with non-identical job sizes and unequal ready times. Comput Oper Res 78:117–128. https://doi.org/10.1016/j.cor.2016.08.015
Arroyo JEC, Leung JY-T, Tavares RG (2019) An iterated greedy algorithm for total flow time minimization in unrelated parallel batch machines with unequal job release times. Eng Appl Artif Intell 77:239–254. https://doi.org/10.1016/j.engappai.2018.10.012
Avalos-Rosales O, Angel-Bello F, Alvarez A (2014) Efficient metaheuristic algorithm and re-formulations for the unrelated parallel machine scheduling problem with sequence and machine-dependent setup times. Int J Adv Manuf Technol 76(9–12):1705–1718. https://doi.org/10.1007/s00170-014-6390-6
Avalos-Rosales O, Angel-Bello F, Alvarez A, Cardona-Valdes Y (2018) Including preventive maintenance activities in an unrelated parallel machine environment with dependent setup times. Comput Ind Eng 123:364–377. https://doi.org/10.1016/j.cie.2018.07.006
Babaei H, Karimpour J, Hadidi A (2015) A survey of approaches for university course timetabling problem. Comput Ind Eng 86:43–59. https://doi.org/10.1016/j.cie.2014.11.010 (Applications of Computational Intelligence and Fuzzy Logic to Manufacturing and Service Systems)
Balin S (2011) Non-identical parallel machine scheduling using genetic algorithm. Exp Syst Appl 38(6):6814–6821. https://doi.org/10.1016/j.eswa.2010.12.064
Bandyopadhyay S, Bhattacharya R (2013) Solving multi-objective parallel machine scheduling problem by a modified NSGA-II. Appl Math Model 37(10):6718–6729. https://doi.org/10.1016/j.apm.2013.01.050
Bank J, Werner F (2001) Heuristic algorithms for unrelated parallel machine scheduling with a common due date, release dates, and linear earliness and tardiness penalties. Math Comput Model 33(4–5):363–383. https://doi.org/10.1016/s0895-7177(00)00250-8
Bektur G, Sarac T (2019) A mathematical model and heuristic algorithms for an unrelated parallel machine scheduling problem with sequence-dependent setup times, machine eligibility restrictions and a common server. Comput Oper Res 103:46–63. https://doi.org/10.1016/j.cor.2018.10.010
Bhardwaj AK, Gajpal Y, Surti C, Gill SS (2020) HEART: unrelated parallel machines problem with precedence constraints for task scheduling in cloud computing using heuristic and meta-heuristic algorithms. Softw: Pract Exp 50(12):2231–2251. https://doi.org/10.1002/spe.2890
Bilyk A, Mönch L (2010) A variable neighborhood search approach for planning and scheduling of jobs on unrelated parallel machines. J Intell Manuf 23(5):1621–1635. https://doi.org/10.1007/s10845-010-0464-6
Bitar A, Dauzère-Pérès S, Yugma C, Roussel R (2014) A memetic algorithm to solve an unrelated parallel machine scheduling problem with auxiliary resources in semiconductor manufacturing. J Sched 19(4):367–376. https://doi.org/10.1007/s10951-014-0397-6
Bozorgirad MA, Logendran R (2012) Sequence-dependent group scheduling problem on unrelated-parallel machines. Exp Syst Appl 39(10):9021–9030. https://doi.org/10.1016/j.eswa.2012.02.032
Branke J, Nguyen S, Pickardt CW, Zhang M (2016) Automated design of production scheduling heuristics: a review. IEEE Trans Evolut Comput 20(1):110–124. https://doi.org/10.1109/TEVC.2015.2429314
Braun TD, Siegel HJ, Beck N, Bölöni LL, Maheswaran M, Reuther AI, Robertson JP, Theys MD, Yao B, Hensgen D, Freund RF (2001) A comparison of eleven static heuristics for mapping a class of independent tasks onto heterogeneous distributed computing systems. J Parallel Distrib Comput 61(6):810–837. https://doi.org/10.1006/jpdc.2000.1714
Braun T, Siegal H, Beck N, Boloni L, Maheswaran M, Reuther A, Robertson J, Theys M, Yao B, Hensgen D, Freund R (1999) A comparison study of static mapping heuristics for a class of meta-tasks on heterogeneous computing systems. In: Proceedings. Eighth heterogeneous computing workshop (HCW’99), pp 15–29. https://doi.org/10.1109/HCW.1999.765093
Briceño LD, Siegel HJ, Maciejewski AA, Oltikar M (2012) Characterization of the iterative application of makespan heuristics on non-makespan machines in a heterogeneous parallel and distributed environment. J Supercomput 62(1):461–485. https://doi.org/10.1007/s11227-011-0729-7
Caniyilmaz E, Benli B, Ilkay MS (2014) An artificial bee colony algorithm approach for unrelated parallel machine scheduling with processing set restrictions, job sequence-dependent setup times, and due date. Int J Adv Manuf Technol 77(9–12):2105–2115. https://doi.org/10.1007/s00170-014-6614-9
Cao D, Chen M, Wan G (2005) Parallel machine selection and job scheduling to minimize machine cost and job tardiness. Comput Oper Res 32(8):1995–2012. https://doi.org/10.1016/j.cor.2004.01.001
Cappadonna FA, Costa A, Fichera S (2012) Three genetic algorithm approaches to the unrelated parallel machine scheduling problem with limited human resources. In: Proceedings of the 4th international joint conference on computational intelligence—ECTA, (IJCCI 2012), pp 170–175. INSTICC, SciTePress. https://doi.org/10.5220/0004116501700175
Cappadonna F, 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 (Eighth CIRP Conference on Intelligent Computation in Manufacturing Engineering)
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. https://doi.org/10.1080/00207540601138452
Chang P-C, Chen S-H (2011) Integrating dominance properties with genetic algorithms for parallel machine scheduling problems with setup times. Appl Soft Comput 11(1):1263–1274. https://doi.org/10.1016/j.asoc.2010.03.003
Chang Y-C, Li VC, Chiang C-J (2014) An ant colony optimization heuristic for an integrated production and distribution scheduling problem. Eng Optim 46(4):503–520. https://doi.org/10.1080/0305215X.2013.786062
Charalambous C, Fleszar K, Hindi KS (2010) A hybrid searching method for the unrelated parallel machine scheduling problem. In: Papadopoulos H, Andreou AS, Bramer M (eds) Artificial intelligence applications and innovations. Springer, Berlin, pp 230–237
Chaudhry IA, Khan AA (2015) A research survey: review of flexible job shop scheduling techniques. Int Trans Oper Res 23(3):551–591. https://doi.org/10.1111/itor.12199
Che A, Zhang S, Wu X (2017) Energy-conscious unrelated parallel machine scheduling under time-of-use electricity tariffs. J Clean Prod 156:688–697. https://doi.org/10.1016/j.jclepro.2017.04.018
Chen C-L (2008) An iterated local search for unrelated parallel machines problem with unequal ready times. In: 2008 IEEE international conference on automation and logistics, pp 2044–2047. https://doi.org/10.1109/ICAL.2008.4636499
Chen J-F (2004) Unrelated parallel machine scheduling with secondary resource constraints. Int J Adv Manuf Technol 26(3):285–292. https://doi.org/10.1007/s00170-003-1622-1
Chen J-F (2006) Minimization of maximum tardiness on unrelated parallel machines with process restrictions and setups. Int J Adv Manuf Technol 29(5–6):557–563. https://doi.org/10.1007/bf02729109
Chen J-F (2009) Scheduling on unrelated parallel machines with sequence- and machine-dependent setup times and due-date constraints. Int J Adv Manuf Technol 44(11–12):1204–1212. https://doi.org/10.1007/s00170-008-1917-3
Chen C-L (2011) Iterated hybrid metaheuristic algorithms for unrelated parallel machines problem with unequal ready times and sequence-dependent setup times. Int J Adv Manuf Technol 60(5–8):693–705. https://doi.org/10.1007/s00170-011-3623-9
Chen J-F (2013) Unrelated parallel-machine scheduling to minimize total weighted completion time. J Intell Manuf 26(6):1099–1112. https://doi.org/10.1007/s10845-013-0842-y
Chen C-L, Chen C-L (2008) Hybrid metaheuristics for unrelated parallel machine scheduling with sequence-dependent setup times. Int J Adv Manuf Technol 43(1–2):161–169. https://doi.org/10.1007/s00170-008-1692-1
Chen J-F, Wu T-H (2006) Total tardiness minimization on unrelated parallel machine scheduling with auxiliary equipment constraints. Omega 34(1):81–89. https://doi.org/10.1016/j.omega.2004.07.023
Cheng C-Y, Huang L-W (2017) Minimizing total earliness and tardiness through unrelated parallel machine scheduling using distributed release time control. J Manuf Syst 42:1–10. https://doi.org/10.1016/j.jmsy.2016.10.005
Cheng T, Sin C (1990) A state-of-the-art review of parallel-machine scheduling research. Eur J Oper Res 47(3):271–292. https://doi.org/10.1016/0377-2217(90)90215-W
Cheng C-Y, Pourhejazy P, Ying K-C, Lin C-F (2021) Unsupervised learning-based artificial bee colony for minimizing non-value-adding operations. Appl Soft Comput 105:107280. https://doi.org/10.1016/j.asoc.2021.107280
Chen B, Potts CN, Woeginger GJ (1998) A review of machine scheduling: complexity, algorithms and approximability. In: Handbook of combinatorial optimization. Springer, pp 1493–1641. https://doi.org/10.1007/978-1-4613-0303-9_25
Chyu C-C, Chang W-S (2010) A competitive evolution strategy memetic algorithm for unrelated parallel machine scheduling to minimize total weighted tardiness and flow time. In: The 40th international conference on computers industrial engineering, pp 1–6. https://doi.org/10.1109/ICCIE.2010.5668388
Chyu C-C, Chang W-S (2009) A pareto evolutionary algorithm approach to bi-objective unrelated parallel machine scheduling problems. Int J Adv Manuf Technol 49(5–8):697–708. https://doi.org/10.1007/s00170-009-2419-7
Cochran JK, Horng S-M, Fowler JW (2003) A multi-population genetic algorithm to solve multi-objective scheduling problems for parallel machines. Comput Oper Res 30(7):1087–1102. https://doi.org/10.1016/S0305-0548(02)00059-X
Costa A, Cappadonna FA, Fichera S (2013) A hybrid genetic algorithm for job sequencing and worker allocation in parallel unrelated machines with sequence-dependent setup times. Int J Adv Manuf Technol 69(9–12):2799–2817. https://doi.org/10.1007/s00170-013-5221-5
Cota LP, Guimarães FG, de Oliveira FB, Freitas Souza MJ (2017) An adaptive large neighborhood search with learning automata for the unrelated parallel machine scheduling problem. In: 2017 IEEE congress on evolutionary computation (CEC), pp 185–192. https://doi.org/10.1109/CEC.2017.7969312
Cota LP, Haddad MN, Freitas Souza MJ, Coelho VN (2014) Airp: a heuristic algorithm for solving the unrelated parallel machine scheduling problem. In: 2014 IEEE congress on evolutionary computation (CEC), pp 1855–1862. https://doi.org/10.1109/CEC.2014.6900245
Cruz-Chavez MA, Juarez-Perez F, Avila-Melgar EY, Martinez-Oropeza A (2009) Simulated annealing algorithm for the weighted unrelated parallel machines problem. In: 2009 Electronics, robotics and automotive mechanics conference (CERMA), pp 94–99. https://doi.org/10.1109/CERMA.2009.46
de Abreu LR, de Athayde Prata B (2020) A genetic algorithm with neighborhood search procedures for unrelated parallel machine scheduling problem with sequence-dependent setup times. J Model Manag 15(3):809–828. https://doi.org/10.1108/jm2-12-2018-0209
de Paula MR, Ravetti MG, Mateus GR, Pardalos PM (2007) Solving parallel machines scheduling problems with sequence-dependent setup times using variable neighbourhood search. IMA J Manag Math 18(2):101–115. https://doi.org/10.1093/imaman/dpm016
De P, Morton TE (1980) Scheduling to minimize makespan on unequal parallel processors. Decis Sci 11(4):586–602. https://doi.org/10.1111/j.1540-5915.1980.tb01163.x
de C. M. Nogueira JP, Arroyo JEC, Villadiego HMM, Gonçalves LB (2014) Hybrid grasp heuristics to solve an unrelated parallel machine scheduling problem with earliness and tardiness penalties. Electronic Notes in Theoretical Computer Science 302:53–72. https://doi.org/10.1016/j.entcs.2014.01.020 (Proceedings of the XXXIX Latin American computing conference (CLEI 2013))
Dhaenens-Flipo C (2001) A bicriterion approach to deal with a constrained single-objective problem. Int J Prod Econ 74(1):93–101. https://doi.org/10.1016/S0925-5273(01)00110-4 (Poductive Systems: Strategy, Control, and Management)
Diana RO, Filho MFdF, Souza SRd, Silva MAL (2013) A clonal selection algorithm for makespan minimization on unrelated parallel machines with sequence dependent setup times. In: 2013 Brazilian conference on intelligent systems, pp 57–63. https://doi.org/10.1109/BRACIS.2013.18
Diana ROM, de Souza SR, Wanner EF, Filho MFF (2017) Hybrid metaheuristic for combinatorial optimization based on immune network for optimization and vns. In: Proceedings of the genetic and evolutionary computation conference, GECCO ’17, pp 251–258, New York, NY, USA. Association for Computing Machinery https://doi.org/10.1145/3071178.3071269
Diana ROM, de França Filho MF, de Souza SR, de Almeida Vitor JF (2015) 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. https://doi.org/10.1016/j.neucom.2014.06.091 (Recent Advancements in Hybrid Artificial Intelligence Systems and its Application to Real-World Problems Progress in Intelligent Systems Mining Humanistic Data)
Diana RO, de Souza SR, Filho MF (2018) A variable neighborhood descent as ils local search to the minimization of the total weighted tardiness on unrelated parallel machines and sequence dependent setup times. Electron Notes Discret Math 66:191–198. https://doi.org/10.1016/j.endm.2018.03.025 (5th International Conference on Variable Neighborhood Search)
Dolgui A, Eremeev AV, Kovalyov MY, Kuznetsov PM (2009) Multi-product lot-sizing and scheduling on unrelated parallel machines to minimize makespan. IFAC Proc Vol 42(4):828–833. https://doi.org/10.3182/20090603-3-RU-2001.0553 (13th IFAC Symposium on Information Control Problems in Manufacturing)
Du Kim H, Kim JS (2004) An online scheduling algorithm for grid computing systems. In: Li M, Sun X-H, Deng Q, Ni J (eds) Grid and cooperative computing. Springer, Berlin, pp 34–39
Đurasević M, Jakobović D (2017) Comparison of ensemble learning methods for creating ensembles of dispatching rules for the unrelated machines environment. Genet Program Evolvable Mach 19(1–2):53–92. https://doi.org/10.1007/s10710-017-9302-3
Đurasević M, Jakobović D (2017) Evolving dispatching rules for optimising many-objective criteria in the unrelated machines environment. Genet Program Evolvable Mach 19(1–2):9–51. https://doi.org/10.1007/s10710-017-9310-3
Đurasević M, Jakobović D (2018) A survey of dispatching rules for the dynamic unrelated machines environment. Exp Syst Appl 113:555–569. https://doi.org/10.1016/j.eswa.2018.06.053
Đurasević M, Jakobović D (2019) Creating dispatching rules by simple ensemble combination. J Heuristics 25(6):959–1013. https://doi.org/10.1007/s10732-019-09416-x
Đurasević M, Jakobović D (2020) Automatic design of dispatching rules for static scheduling conditions. Neural Comput Appl 33(10):5043–5068. https://doi.org/10.1007/s00521-020-05292-w
Đurasević M, Jakobović D (2020) Comparison of schedule generation schemes for designing dispatching rules with genetic programming in the unrelated machines environment. Appl Soft Comput 96:106637. https://doi.org/10.1016/j.asoc.2020.106637
Đurasević M, Jakobović D (2022) Selection of dispatching rules evolved by genetic programming in dynamic unrelated machines scheduling based on problem characteristics. J Comput Sci 61:101649. https://doi.org/10.1016/j.jocs.2022.101649
Đurasević M, Jakobović D, Knežević K (2016) Adaptive scheduling on unrelated machines with genetic programming. Appl Soft Comput 48:419–430. https://doi.org/10.1016/j.asoc.2016.07.025
Đurasević M, Jakobović D (2016) Comparison of solution representations for scheduling in the unrelated machines environment. In: 2016 39th international convention on information and communication technology, electronics and microelectronics (MIPRO), pp 1336–1342. https://doi.org/10.1109/MIPRO.2016.7522347
e Santos AS, Madureira AM (2014) Ordered minimum completion time heuristic for unrelated parallel-machines problems. In: 2014 9th Iberian conference on information systems and technologies (CISTI), pp 1–6. https://doi.org/10.1109/CISTI.2014.6876939
Ebrahimi E, Rezaeian J (2015) Unrelated parallel machines scheduling with the effect of aging and learning under multi maintenance activities. Manuf Sci Technol 3(2):25–31. https://doi.org/10.13189/mst.2015.030201
Erdelić T, Carić T (2019) A survey on the electric vehicle routing problem: variants and solution approaches. J Adv Transp 2019:1–48. https://doi.org/10.1155/2019/5075671
Ernst A, Jiang H, Krishnamoorthy M, Sier D (2004) Staff scheduling and rostering: a review of applications, methods and models. Eur J Oper Res 153(1):3–27. https://doi.org/10.1016/S0377-2217(03)00095-X (Timetabling and Rostering)
Eroglu DY, Ozmutlu HC, Ozmutlu S (2014) Genetic algorithm with local search for the unrelated parallel machine scheduling problem with sequence-dependent set-up times. Int J Prod Res 52(19):5841–5856. https://doi.org/10.1080/00207543.2014.920966
Ewees AA, Al-qaness MA, Abd Elaziz M (2021) Enhanced salp swarm algorithm based on firefly algorithm for unrelated parallel machine scheduling with setup times. Appl Math Model 94:285–305. https://doi.org/10.1016/j.apm.2021.01.017
Ezugwu AE (2019) Enhanced symbiotic organisms search algorithm for unrelated parallel machines manufacturing scheduling with setup times. Knowl-Based Syst 172:15–32. https://doi.org/10.1016/j.knosys.2019.02.005
Ezugwu AE, Akutsah F (2018) An improved firefly algorithm for the unrelated parallel machines scheduling problem with sequence-dependent setup times. IEEE Access 6:54459–54478. https://doi.org/10.1109/ACCESS.2018.2872110
Ezugwu AE, Adeleke OJ, Viriri S (2018) Symbiotic organisms search algorithm for the unrelated parallel machines scheduling with sequence-dependent setup times. PLoS ONE 13(7):e0200030. https://doi.org/10.1371/journal.pone.0200030
Fanjul-Peyro L (2020) Models and an exact method for the unrelated parallel machine scheduling problem with setups and resources. Exp Syst Appl: X 5:100022. https://doi.org/10.1016/j.eswax.2020.100022
Fanjul-Peyro L, Ruiz R (2010) Iterated greedy local search methods for unrelated parallel machine scheduling. Eur J Oper Res 207(1):55–69. https://doi.org/10.1016/j.ejor.2010.03.030
Fanjul-Peyro L, Ruiz R (2011) Size-reduction heuristics for the unrelated parallel machines scheduling problem. Comput Oper Res 38(1):301–309. https://doi.org/10.1016/j.cor.2010.05.005 (Project Management and Scheduling)
Fanjul-Peyro L, Ruiz R (2012) Scheduling unrelated parallel machines with optional machines and jobs selection. Comput Oper Res 39(7):1745–1753. https://doi.org/10.1016/j.cor.2011.10.012
Fanjul-Peyro L, Perea F, Ruiz R (2017) Models and matheuristics for the unrelated parallel machine scheduling problem with additional resources. Eur J Oper Res 260(2):482–493. https://doi.org/10.1016/j.ejor.2017.01.002
Fleszar K, Charalambous C, Hindi KS (2011) A variable neighborhood descent heuristic for the problem of makespan minimisation on unrelated parallel machines with setup times. J Intell Manuf 23(5):1949–1958. https://doi.org/10.1007/s10845-011-0522-8
Gao J (2005) A parallel hybrid genetic algorithm for solving a kind of non-identical parallel machine scheduling problems. In: Eighth international conference on high-performance computing in Asia-Pacific region (HPCASIA’05), pp 4 pp.–472. https://doi.org/10.1109/HPCASIA.2005.8
Gao J (2010) A novel artificial immune system for solving multiobjective scheduling problems subject to special process constraint. Comput Ind Eng 58(4):602–609. https://doi.org/10.1016/j.cie.2009.12.009
Gao J, He G, Wang Y (2008) A new parallel genetic algorithm for solving multiobjective scheduling problems subjected to special process constraint. Int J Adv Manuf Technol 43(1–2):151–160. https://doi.org/10.1007/s00170-008-1683-2
Gedik R, Kalathia D, Egilmez G, Kirac E (2018) A constraint programming approach for solving unrelated parallel machine scheduling problem. Comput Ind Eng 121:139–149. https://doi.org/10.1016/j.cie.2018.05.014
Ghaleb M, Taghipour S, Zolfagharinia H (2020) Joint optimization of maintenance and production scheduling for unrelated parallel-machine system. In: 2020 Asia-Pacific international symposium on advanced reliability and maintenance modeling (APARM). IEEE. https://doi.org/10.1109/aparm49247.2020.9209399
Glass C, Potts C, Shade P (1994) Unrelated parallel machine scheduling using local search. Math Comput Model 20(2):41–52. https://doi.org/10.1016/0895-7177(94)90205-4
Golconda KS, Dogan A, Özgüner F (2004) Static mapping heuristics for tasks with hard deadlines in real-time heterogeneous systems. In: Aykanat C, Dayar T, Korpeoglu I (eds) Computer and information sciences—ISCIS 2004, 19th international symposium, Kemer-Antalya, Turkey, October 27-29, 2004. Proceedings, volume 3280 of Lecture Notes in Computer Science, pp 827–836. Springer. https://doi.org/10.1007/978-3-540-30182-0_83
Graham R, Lawler E, Lenstra J, Kan A (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. In: Hammer P, Johnson E, Korte B (eds), Discrete optimization II, volume 5 of Annals of Discrete Mathematics, pp 287–326. Elsevier. https://doi.org/10.1016/S0167-5060(08)70356-X
Guo Y, Lim A, Rodrigues B, Yang L (2007) Minimizing the makespan for unrelated parallel machines. Int J Artif Intell Tools 16(03):399–415. https://doi.org/10.1142/s0218213007003175
Haddad MN, Coelho IM, Souza MJF, Ochi LS, Santos HG, Martins AX (2012) Garp: a new genetic algorithm for the unrelated parallel machine scheduling problem with setup times. In: 2012 31st international conference of the Chilean computer science society, pp 152–160. https://doi.org/10.1109/SCCC.2012.25
Hariri A, Potts C (1991) Heuristics for scheduling unrelated parallel machines. Comput Oper Res 18(3):323–331. https://doi.org/10.1016/0305-0548(91)90034-O
Hart E, Ross P, Corne D (2005) Evolutionary scheduling: a review. Genet Program Evolvable Mach 6(2):191–220. https://doi.org/10.1007/s10710-005-7580-7
Hassan Abdel-Jabbar M-A, Kacem I, Martin S (2014) Unrelated parallel machines with precedence constraints: application to cloud computing. In: 2014 IEEE 3rd international conference on cloud networking (CloudNet), pp 438–442. https://doi.org/10.1109/CloudNet.2014.6969034
Helal M, Rabadi G, Al-Salem A (2006) A tabu search algorithm to minimize the makespan for the unrelated parallel machines scheduling problem with setup times. Int J Oper Res 3:182–192
Herrmann J, Proth J-M, 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
Ibarra OH, Kim CE (1977) Heuristic algorithms for scheduling independent tasks on nonidentical processors. J ACM 24(2):280–289. https://doi.org/10.1145/322003.322011
Izakian H, Abraham A, Snasel V (2009) Comparison of heuristics for scheduling independent tasks on heterogeneous distributed environments. In: 2009 international joint conference on computational sciences and optimization, vol 1, pp 8–12. https://doi.org/10.1109/CSO.2009.487
Jaklinović K, Đurasević M, Jakobović D (2021) Designing dispatching rules with genetic programming for the unrelated machines environment with constraints. Exp Syst Appl 172:114548. https://doi.org/10.1016/j.eswa.2020.114548
Jolai F, Amalnick MS, Alinaghian M, Shakhsi-Niaei M, Omrani H (2009) A hybrid memetic algorithm for maximizing the weighted number of just-in-time jobs on unrelated parallel machines. J Intell Manuf 22(2):247–261. https://doi.org/10.1007/s10845-009-0285-7
Joo CM, Kim BS (2015) Hybrid genetic algorithms with dispatching rules for unrelated parallel machine scheduling with setup time and production availability. Comput Ind Eng 85:102–109. https://doi.org/10.1016/j.cie.2015.02.029
Joo CM, Kim BS (2017) Rule-based meta-heuristics for integrated scheduling of unrelated parallel machines, batches, and heterogeneous delivery trucks. Appl Soft Comput 53:457–476. https://doi.org/10.1016/j.asoc.2016.12.038
Jou C (2005) A genetic algorithm with sub-indexed partitioning genes and its application to production scheduling of parallel machines. Comput Ind Eng 48(1):39–54. https://doi.org/10.1016/j.cie.2004.07.007 (Selected Papers from the 31st. International Conference on Computers and Industrial Engineering)
Jouhari H, Lei D, Al-qaness AA, Abd Elaziz M, Ewees AA, Farouk O (2019) Sine-cosine algorithm to enhance simulated annealing for unrelated parallel machine scheduling with setup times. Mathematics. https://doi.org/10.3390/math7111120
Jouhari H, Lei D, Al-qaness MAA, Elaziz MA, Damaševičius R, Korytkowski M, Ewees AA (2020) Modified Harris Hawks optimizer for solving machine scheduling problems. Symmetry. https://doi.org/10.3390/sym12091460
Jovanovic R, Voß S (2021) Fixed set search application for minimizing the makespan on unrelated parallel machines with sequence-dependent setup times. Appl Soft Comput 110:107521. https://doi.org/10.1016/j.asoc.2021.107521
Kayvanfar V, Teymourian E (2014) Hybrid intelligent water drops algorithm to unrelated parallel machines scheduling problem: a just-in-time approach. Int J Prod Res 52(19):5857–5879. https://doi.org/10.1080/00207543.2014.923124
Keskinturk T, Yildirim MB, Barut M (2012) An ant colony optimization algorithm for load balancing in parallel machines with sequence-dependent setup times. Comput Oper Res 39(6):1225–1235. https://doi.org/10.1016/j.cor.2010.12.003 (Special Issue on Scheduling in Manufacturing Systems)
Kim S-I, Choi H-S, Lee D-H (2006) Tabu search heuristics for parallel machine scheduling with sequence-dependent setup and ready times. In: Computational science and its applications—ICCSA 2006. Springer, Berlin, pp 728–737. https://doi.org/10.1007/11751595_77
Kim D-W, Kim K-H, Jang W, Frank Chen F (2002) Unrelated parallel machine scheduling with setup times using simulated annealing. Robot Comput-Integr Manuf 18(3):223–231. https://doi.org/10.1016/S0736-5845(02)00013-3 (11th International Conference on Flexible Automation and Intelligent Manufacturing)
Kim D-W, Na D-G, Frank Chen F (2003) Unrelated parallel machine scheduling with setup times and a total weighted tardiness objective. Robot Comput-Integr Manuf 19(1):173–181. https://doi.org/10.1016/S0736-5845(02)00077-7 (12th International Conference on Flexible Automation and Intellig ent Manufacturing)
Kim S-I, Choi H-S, Lee D-H (2007) Scheduling algorithms for parallel machines with sequence-dependent set-up and distinct ready times: minimizing total tardiness. Proc Inst Mech Eng Part B: J Eng Manuf 221(6):1087–1096. https://doi.org/10.1243/09544054JEM779
Klemmt A, Weigert G, Almeder C, Mönch L (2009) A comparison of MIP-based decomposition techniques and VNS approaches for batch scheduling problems. In: Proceedings of the 2009 winter simulation conference (WSC), pp 1686–1694. https://doi.org/10.1109/WSC.2009.5429173
Koza JR (2010) Human-competitive results produced by genetic programming. Genet Program Evolvable Mach 11(3–4):251–284. https://doi.org/10.1007/s10710-010-9112-3
Kramer A, Subramanian A (2017) A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems. J Sched 22(1):21–57. https://doi.org/10.1007/s10951-017-0549-6
Kucukoglu I, Dewil R, Cattrysse D (2021) The electric vehicle routing problem and its variations: a literature review. Comput Ind Eng 161:107650. https://doi.org/10.1016/j.cie.2021.107650
Lee J-H, Yu J-M, Lee D-H (2013) A tabu search algorithm for unrelated parallel machine scheduling with sequence- and machine-dependent setups: minimizing total tardiness. Int J Adv Manuf Technol 69(9–12):2081–2089. https://doi.org/10.1007/s00170-013-5192-6
Lee C-H, Liao C-J, Chao C-W (2014) Unrelated parallel machine scheduling with dedicated machines and common deadline. Comput Ind Eng 74:161–168. https://doi.org/10.1016/j.cie.2014.05.012
Lei D, Cai J (2020) Multi-population meta-heuristics for production scheduling: a survey. Swarm Evolut Comput 58:100739. https://doi.org/10.1016/j.swevo.2020.100739
Lei D, Liu M (2020) An artificial bee colony with division for distributed unrelated parallel machine scheduling with preventive maintenance. Comput Ind Eng 141:106320. https://doi.org/10.1016/j.cie.2020.106320
Lei D, Yuan Y, Cai J (2020) An improved artificial bee colony for multi-objective distributed unrelated parallel machine scheduling. Int J Prod Res. https://doi.org/10.1080/00207543.2020.1775911
Lei D, Yuan Y, Cai J, Bai D (2020) An imperialist competitive algorithm with memory for distributed unrelated parallel machines scheduling. Int J Prod Res 58(2):597–614. https://doi.org/10.1080/00207543.2019.1598596
Lensen A, Xue B, Zhang M (2021) Genetic programming for manifold learning: preserving local topology. https://doi.org/10.25455/wgtn.16416828.v1
Lenstra JK, Shmoys DB, Tardos É (1990) Approximation algorithms for scheduling unrelated parallel machines. Math Program 46(1–3):259–271. https://doi.org/10.1007/bf01585745
Leung JY-T (2004) Handbook of scheduling?: algorithms, models, and performance analysis. Chapman & Hall/CRC, Boca Raton
Li X, Huang Y, Tan Q, Chen H (2013) Scheduling unrelated parallel batch processing machines with non-identical job sizes. Comput Oper Res 40(12):2983–2990. https://doi.org/10.1016/j.cor.2013.06.016
Li Z, Yang H, Zhang S, Liu G (2015) Unrelated parallel machine scheduling problem with energy and tardiness cost. Int J Adv Manuf Technol 84(1–4):213–226. https://doi.org/10.1007/s00170-015-7657-2
Liang P, dong Yang H, sheng Liu G, hua Guo J (2015) An ant optimization model for unrelated parallel machine scheduling with energy consumption and total tardiness. Math Probl Eng 2015:1–8. https://doi.org/10.1155/2015/907034
Liao T, Chang P, Kuo R, Liao C-J (2014) A comparison of five hybrid metaheuristic algorithms for unrelated parallel-machine scheduling and inbound trucks sequencing in multi-door cross docking systems. Appl Soft Comput 21:180–193. https://doi.org/10.1016/j.asoc.2014.02.026
Liao C-J, Lee C-H, Tsai H-T (2016) Scheduling with multi-attribute set-up times on unrelated parallel machines. Int J Prod Res 54(16):4839–4853. https://doi.org/10.1080/00207543.2015.1118574
Lin Y-K (2013) Particle swarm optimization algorithm for unrelated parallel machine scheduling with release dates. Math Probl Eng 2013:1–9. https://doi.org/10.1155/2013/409486
Lin Y-K, Hsieh F-Y (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
Lin D-Y, Huang T-Y (2021) A hybrid metaheuristic for the unrelated parallel machine scheduling problem. Mathematics. https://doi.org/10.3390/math9070768
Lin Y-K, Lin H-C (2015) Bicriteria scheduling problem for unrelated parallel machines with release dates. Comput Oper Res 64:28–39. https://doi.org/10.1016/j.cor.2015.04.025
Lin S-W, Ying K-C (2014) Abc-based manufacturing scheduling for unrelated parallel machines with machine-dependent and job sequence-dependent setup times. Comput Oper Res 51:172–181. https://doi.org/10.1016/j.cor.2014.05.013
Lin S-W, Ying K-C (2015) A multi-point simulated annealing heuristic for solving multiple objective unrelated parallel machine scheduling problems. Int J Prod Res 53(4):1065–1076. https://doi.org/10.1080/00207543.2014.942011
Lin S-W, Lu C-C, Ying K-C (2010) Minimization of total tardiness on unrelated parallel machines with sequence- and machine-dependent setup times under due date constraints. Int J Adv Manuf Technol 53(1–4):353–361. https://doi.org/10.1007/s00170-010-2824-y
Lin Y, Pfund M, Fowler J (2011) Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems. Comput Oper Res 38(6):901–916. https://doi.org/10.1016/j.cor.2010.08.018
Lin C-W, Lin Y-K, Hsieh H-T (2013) Ant colony optimization for unrelated parallel machine scheduling. Int J Adv Manuf Technol 67(1–4):35–45. https://doi.org/10.1007/s00170-013-4766-7
Lin Y-K, Fowler JW, Pfund ME (2013) Multiple-objective heuristics for scheduling unrelated parallel machines. Eur J Oper Res 227(2):239–253. https://doi.org/10.1016/j.ejor.2012.10.008
Lin S-W, Ying K-C, Wu W-J, Chiang Y-I (2016) Multi-objective unrelated parallel machine scheduling: a tabu-enhanced iterated pareto greedy algorithm. Int J Prod Res 54(4):1110–1121. https://doi.org/10.1080/00207543.2015.1047981
Liu C (2013) A hybrid genetic algorithm to minimize total tardiness for unrelated parallel machine scheduling with precedence constraints. Math Probl Eng 2013:1–11. https://doi.org/10.1155/2013/537127
Liu C, Yang S (2011) A heuristic serial schedule algorithm for unrelated parallel machine scheduling with precedence constraints. J Softw. https://doi.org/10.4304/jsw.6.6.1146-1153
Logendran R, Subur F (2004) Unrelated parallel machine scheduling with job splitting. IIE Trans 36(4):359–372. https://doi.org/10.1080/07408170490279598
Logendran R, McDonell B, Smucker B (2007) Scheduling unrelated parallel machines with sequence-dependent setups. Comput Oper Res 34:3420–3438. https://doi.org/10.1016/j.cor.2006.02.006
long Zheng X, Wang L (2016) A two-stage adaptive fruit fly optimization algorithm for unrelated parallel machine scheduling problem with additional resource constraints. Exp Syst Appl 65:28–39. https://doi.org/10.1016/j.eswa.2016.08.039
Low C, Wu G-H (2016) Unrelated parallel-machine scheduling with controllable processing times and eligibility constraints to minimize the makespan. J Ind Prod Eng 33(4):286–293. https://doi.org/10.1080/21681015.2016.1139005
Low C, Li R-K, Wu G-H (2013) Ant colony optimization algorithms for unrelated parallel machine scheduling with controllable processing times and eligibility constraints. In: Proceedings of the institute of industrial engineers Asian conference 2013. Springer, Singapore, pp 79–87. https://doi.org/10.1007/978-981-4451-98-7_10
Lu S, Liu X, Pei J, Thai MT, Pardalos PM (2018) A hybrid abc-ts algorithm for the unrelated parallel-batching machines scheduling problem with deteriorating jobs and maintenance activity. Appl Soft Comput 66:168–182. https://doi.org/10.1016/j.asoc.2018.02.018
Luo P, Lü K, Shi Z (2007) A revisit of fast greedy heuristics for mapping a class of independent tasks onto heterogeneous computing systems. J Parallel Distrib Comput 67(6):695–714. https://doi.org/10.1016/j.jpdc.2007.03.003
Lu H, Qiao F (2017) An improved genetic algorithm for a parallel machine scheduling problem with energy consideration. In: 2017 13th IEEE conference on automation science and engineering (CASE), pp 1487–1492. https://doi.org/10.1109/COASE.2017.8256314
Maheswaran M, Ali S, Siegel HJ, Hensgen D, Freund RF (1999) Dynamic mapping of a class of independent tasks onto heterogeneous computing systems. J Parallel Distrib Comput 59(2):107–131. https://doi.org/10.1006/jpdc.1999.1581
Manupati VK, Rajyalakshmi G, Chan FTS, Thakkar JJ (2017) A hybrid multi-objective evolutionary algorithm approach for handling sequence- and machine-dependent set-up times in unrelated parallel machine scheduling problem. Sādhanā 42(3):391–403. https://doi.org/10.1007/s12046-017-0611-2
Marinho Diana RO, de Souza SR (2020) Analysis of variable neighborhood descent as a local search operator for total weighted tardiness problem on unrelated parallel machines. Comput Oper Res 117:104886. https://doi.org/10.1016/j.cor.2020.104886
Mehravaran Y, Logendran R (2011) Bicriteria supply chain scheduling on unrelated-parallel machines. J Chin Inst Ind Eng 28(2):91–101. https://doi.org/10.1080/10170669.2010.546165
Min L, Cheng W (2006) Genetic algorithms for the optimal common due date assignment and the optimal scheduling policy in parallel machine earliness/tardiness scheduling problems. Robot Comput-Integr Manuf 22(4):279–287. https://doi.org/10.1016/j.rcim.2004.12.005
Moghdani R, Salimifard K, Demir E, Benyettou A (2021) The green vehicle routing problem: a systematic literature review. J Clean Prod 279:123691. https://doi.org/10.1016/j.jclepro.2020.123691
Mokotoff E (2001) Parallel machine scheduling problems: a survey. Asia-Pac J Oper Res 18
Morton TE, Pentico DW (1993) Heuristic scheduling systems: with applications to production systems and project management. Wiley, New York
Munir EU, Li J, Shi S, Zou Z, Yang D (2008) MaxStd: a task scheduling heuristic for heterogeneous computing environment. Inf Technol J 7(4):679–683. https://doi.org/10.3923/itj.2008.679.683
Na D-G, Kim D-W, Jang W, Chen FF (2006) Scheduling unrelated parallel machines to minimize total weighted tardiness. In: 2006 IEEE International conference on service operations and logistics, and informatics, pp 758–763. https://doi.org/10.1109/SOLI.2006.329085
Nanthapodej R, Liu C-H, Nitisiri K, Pattanapairoj S (2021) Hybrid differential evolution algorithm and adaptive large neighborhood search to solve parallel machine scheduling to minimize energy consumption in consideration of machine-load balance problems. Sustainability. https://doi.org/10.3390/su13105470
Nanthapodej R, Liu C-H, Nitisiri K, Pattanapairoj S (2021) Variable neighborhood strategy adaptive search to solve parallel-machine scheduling to minimize energy consumption while considering job priority and control makespan. Appl Sci. https://doi.org/10.3390/app11115311
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
Nguyen S, Mei Y, Zhang M (2017) Genetic programming for production scheduling: a survey with a unified framework. Complex Intell Syst 3(1):41–66. https://doi.org/10.1007/s40747-017-0036-x
Niu Q, Zhou F, Zhou TJ (2011) An adaptive clonal selection algorithm with stage mutation operation for unrelated parallel machine scheduling problem with sequence-dependent setup times. Key Eng Mater 467–469:1967–1972. https://doi.org/10.4028/www.scientific.net/kem.467-469.1967
Nohra Haddad M, Perdigão Cota L, Jamilson Freitas Souza M, Maculan N (2014). Aiv: a heuristic algorithm based on iterated local search and variable neighborhood descent for solving the unrelated parallel machine scheduling problem with setup times. In: Proceedings of the 16th international conference on enterprise information systems—volume 1, ICEIS 2014, pp 376–383, Setubal, PRT. SCITEPRESS—Science and Technology Publications, Lda. https://doi.org/10.5220/0004884603760383
Orts F, Ortega G, Puertas AM, García I, Garzón EM (2020) On solving the unrelated parallel machine scheduling problem: active microrheology as a case study. J Supercomput 76(11):8494–8509. https://doi.org/10.1007/s11227-019-03121-z
Ouelhadj D, Petrovic S (2008) A survey of dynamic scheduling in manufacturing systems. J Sched 12(4):417–431. https://doi.org/10.1007/s10951-008-0090-8
Özpeynirci S, Gökgür B, Hnich B (2016) Parallel machine scheduling with tool loading. Appl Math Model 40(9):5660–5671. https://doi.org/10.1016/j.apm.2016.01.006
Pan Z, Lei D, Zhang Q (2018) A new imperialist competitive algorithm for multiobjective low carbon parallel machines scheduling. Math Probl Eng 2018:1–13. https://doi.org/10.1155/2018/5914360
Pan Z, Lei D, Wang L (2020) A knowledge-based two-population optimization algorithm for distributed energy-efficient parallel machines scheduling. IEEE Trans Cybern. https://doi.org/10.1109/TCYB.2020.3026571
Panwalkar SS, Iskander W (1977) A survey of scheduling rules. Oper Res 25(1):45–61 (Full publication date: Jan. - Feb., 1977)
Peng J, Liu B (2004) Parallel machine scheduling models with fuzzy processing times. Inf Sci 166(1):49–66. https://doi.org/10.1016/j.ins.2003.05.012
Perez-Gonzalez P, Fernandez-Viagas V, Zamora García M, Framinan JM (2019) Constructive heuristics for the unrelated parallel machines scheduling problem with machine eligibility and setup times. Comput Ind Eng 131:131–145. https://doi.org/10.1016/j.cie.2019.03.034
Piersma N, van Dijk W (1996) A local search heuristic for unrelated parallel machine scheduling with efficient neighborhood search. Math Comput Model 24(9):11–19. https://doi.org/10.1016/0895-7177(96)00150-1
Pinedo ML (2008) Scheduling: theory, algorithms, and systems, 3rd edn. Springer, Berlin
Pinheiro JCSN, Arroyo JEC, Fialho LB (2020) Scheduling unrelated parallel machines with family setups and resource constraints to minimize total tardiness. In: Proceedings of the 2020 genetic and evolutionary computation conference companion, GECCO ’20, pp 1409–1417, New York, NY, USA. Association for Computing Machinery. https://doi.org/10.1145/3377929.3398150
Planinić L, Backović H, Đurasević M, Jakobović D (2022) A comparative study of dispatching rule representations in evolutionary algorithms for the dynamic unrelated machines environment. IEEE Access 10:22886–22901. https://doi.org/10.1109/ACCESS.2022.3151346
Planinić L, Đurasević M, Jakobović D (2021a) Towards interpretable dispatching rules: application of expression simplification methods. In: 2021 IEEE symposium series on computational intelligence (SSCI), pp 01–08. https://doi.org/10.1109/SSCI50451.2021.9659842
Planinić L, Đurasević M, Jakobović D (2021b) On the application of \(\epsilon\)-lexicase selection in the generation of dispatching rules. In: 2021 IEEE congress on evolutionary computation (CEC), pp 2125–2132. https://doi.org/10.1109/CEC45853.2021.9504982
Polyakovskiy S, M’Hallah R (2014) A multi-agent system for the weighted earliness tardiness parallel machine problem. Comput Oper Res 44:115–136. https://doi.org/10.1016/j.cor.2013.10.013
Priore P, Gómez A, Pino R, Rosillo R (2014) Dynamic scheduling of manufacturing systems using machine learning: an updated review. Artif Intell Eng Des Anal Manuf 28(1):83–97. https://doi.org/10.1017/S0890060413000516
Rabadi G, Moraga RJ, Al-Salem A (2006) Heuristics for the unrelated parallel machine scheduling problem with setup times. J Intell Manuf 17(1):85–97. https://doi.org/10.1007/s10845-005-5514-0
Rafsanjani MK, Bardsiri AK (2012) A new heuristic approach for scheduling independent tasks on heterogeneous computing systems. Int J Mach Learn Comput. https://doi.org/10.7763/ijmlc.2012.v2.147
Raja K, Arumugam C, Selladurai V (2008) Non-identical parallel-machine scheduling using genetic algorithm and fuzzy logic approach. Int J Serv Oper Manag 4(1):72. https://doi.org/10.1504/ijsom.2008.015941
Rambod M, Rezaeian J (2014) Robust meta-heuristics implementation for unrelated parallel machines scheduling problem with rework processes and machine eligibility restrictions. Comput Ind Eng 77:15–28. https://doi.org/10.1016/j.cie.2014.09.006
Ramezanian R, Saidi-Mehrabad M (2012) Multi-product unrelated parallel machines scheduling problem with rework processes. Sci Iran 19(6):1887–1893. https://doi.org/10.1016/j.scient.2012.05.004
Randhawa SU, Kuo C-H (1997) Evaluating scheduling heuristics for non-identical parallel processors. Int J Prod Res 35(4):969–981. https://doi.org/10.1080/002075497195489
Randhawa SU, Smith TA (1995) An experimental investigation of scheduling non-identical, parallel processors with sequence-dependent set-up times and due dates. Int J Prod Res 33(1):59–69. https://doi.org/10.1080/00207549508930137
Ravetti MG, Mateus GR, Rocha PL, Pardalos PM (2007) A scheduling problem with unrelated parallel machines and sequence dependent setups. Int J Oper Res 2(4):380. https://doi.org/10.1504/ijor.2007.014169
Rezaeian Zeidi J, Zarei M, Shokoufi K (2017) Pareto-based multi-criteria evolutionary algorithm for parallel machines scheduling problem with sequence-dependent setup times. Int J Eng 30(12):1863–1869
Ritchie G, Levine J (2003) A fast, effective local search for scheduling independent jobs in heterogeneous computing environments
Rodriguez FJ, García-Martínez C, Blum C, Lozano M (2012) An artificial bee colony algorithm for the unrelated parallel machines scheduling problem. In: Lecture Notes in Computer Science. Springer, Berlin, pp 143–152. https://doi.org/10.1007/978-3-642-32964-7_15
Rodriguez FJ, Blum C, García-Martínez C, Lozano M (2012) GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times. Ann Oper Res 201(1):383–401. https://doi.org/10.1007/s10479-012-1164-8
Rodriguez FJ, Lozano M, Blum C, García-Martínez C (2013) An iterated greedy algorithm for the large-scale unrelated parallel machines scheduling problem. Comput Oper Res 40(7):1829–1841. https://doi.org/10.1016/j.cor.2013.01.018
Rojanasoonthon S, Bard J (2005) A GRASP for parallel machine scheduling with time windows. INFORMS J Comput 17(1):32–51. https://doi.org/10.1287/ijoc.1030.0048
Ruiz R, Andrés-Romano C (2011) Scheduling unrelated parallel machines with resource-assignable sequence-dependent setup times. Int J Adv Manuf Technol 57(5–8):777–794. https://doi.org/10.1007/s00170-011-3318-2
Salehi Mir MS, Rezaeian J (2016) A robust hybrid approach based on particle swarm optimization and genetic algorithm to minimize the total machine load on unrelated parallel machines. Appl Soft Comput 41:488–504. https://doi.org/10.1016/j.asoc.2015.12.035
Santos HG, Toffolo TA, Silva CL, Berghe GV (2016) Analysis of stochastic local search methods for the unrelated parallel machine scheduling problem. Int Trans Oper Res 26(2):707–724. https://doi.org/10.1111/itor.12316
Sels V, Coelho J, Manuel Dias A, Vanhoucke M (2015) Hybrid tabu search and a truncated branch-and-bound for the unrelated parallel machine scheduling problem. Comput Oper Res 53:107–117. https://doi.org/10.1016/j.cor.2014.08.002
Shahidi-Zadeh B, Tavakkoli-Moghaddam R, Taheri-Moghadam A, Rastgar I (2017) Solving a bi-objective unrelated parallel batch processing machines scheduling problem: a comparison study. Comput Oper Res 88:71–90. https://doi.org/10.1016/j.cor.2017.06.019
Shahvari O, Logendran R (2017) A bi-objective batch processing problem with dual-resources on unrelated-parallel machines. Appl Soft Comput 61:174–192. https://doi.org/10.1016/j.asoc.2017.08.014
Shahvari O, Logendran R (2017) An enhanced tabu search algorithm to minimize a bi-criteria objective in batching and scheduling problems on unrelated-parallel machines with desired lower bounds on batch sizes. Comput Oper Res 77(C):154–176. https://doi.org/10.1016/j.cor.2016.07.021
Shahvari O, Logendran R (2015) Bi-criteria batch scheduling on unrelated-parallel machines
Siepak M, Józefczyk J (2014) Solution algorithms for unrelated machines minmax regret scheduling problem with interval processing times and the total flow time criterion. Ann Oper Res 222(1):517–533. https://doi.org/10.1007/s10479-014-1538-1
Silva C, Magalhaes JM (2006) Heuristic lot size scheduling on unrelated parallel machines with applications in the textile industry. Comput Ind Eng 50(1):76–89. https://doi.org/10.1016/j.cie.2006.01.001
Slotnick SA (2011) Order acceptance and scheduling: a taxonomy and review. Eur J Oper Res 212(1):1–11. https://doi.org/10.1016/j.ejor.2010.09.042
Soleimani H, Ghaderi H, Tsai P-W, Zarbakhshnia N, Maleki M (2020) Scheduling of unrelated parallel machines considering sequence-related setup time, start time-dependent deterioration, position-dependent learning and power consumption minimization. J Clean Prod 249:119428. https://doi.org/10.1016/j.jclepro.2019.119428
Sörensen K (2013) Metaheuristics-the metaphor exposed. Int Trans Oper Res 22(1):3–18. https://doi.org/10.1111/itor.12001
Srivastava B (1998) An effective heuristic for minimising makespan on unrelated parallel machines. J Oper Res Soc 49(8):886. https://doi.org/10.2307/3009970
Strohhecker J, Hamann M, Thun J-H (2016) Loading and sequencing heuristics for job scheduling on two unrelated parallel machines with long, sequence-dependent set-up times. Int J Prod Res 54(22):6747–6767. https://doi.org/10.1080/00207543.2016.1173248
Suresh V, Chaudhuri D (1994) Minimizing maximum tardiness for unrelated parallel machines. Int J Prod Econ 34(2):223–229. https://doi.org/10.1016/0925-5273(94)90038-8
Suresh V, Chaudhuri D (1996) Bicriteria scheduling problem for unrelated parallel machines. Comput Ind Eng 30(1):77–82. https://doi.org/10.1016/0360-8352(95)00028-3
Suresh V, Ghaudhuri D (1996) Scheduling of unrelated parallel machines when machine availability is specified. Prod Plan Control 7(4):393–400. https://doi.org/10.1080/09537289608930367
Taboada HA, Coit DW (2008) Multi-objective scheduling problems: determination of pruned pareto sets. IIE Trans 40(5):552–564. https://doi.org/10.1080/07408170701781951
Tamaki H, Hasegawa Y, Kozasa J, Araki M (1993) Application of search methods to scheduling problem in plastics forming plant: a binary representation approach. In: Proceedings of 32nd IEEE conference on decision and control, vol 4, pp 3845–3850. https://doi.org/10.1109/CDC.1993.325943
Tavakkoli-Moghaddam R, Taheri F, Bazzazi M, Izadi M, Sassani F (2009) Design of a genetic algorithm for bi-objective unrelated parallel machines scheduling with sequence-dependent setup times and precedence constraints. Comput Oper Res 36(12):3224–3230. https://doi.org/10.1016/j.cor.2009.02.012 (New developments on hub location)
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 NT, Jearanaitanakij K, Selamat A, Trawiński B, Chittayasothorn S (eds) Intelligent information and database systems. Springer, Cham, pp 249–258
Torabi S, Sahebjamnia N, Mansouri S, Bajestani MA (2013) A particle swarm optimization for a fuzzy multi-objective unrelated parallel machines scheduling problem. Appl Soft Comput 13(12):4750–4762. https://doi.org/10.1016/j.asoc.2013.07.029
Tozzo E, Cotrim SL, Galdamez EVC, Leal GCL (2018) A genetic algorithm and variable neighborhood search for the unrelated parallel machine scheduling problem with sequence dependent setup time. Acta Scientiarum Technol 40(1):36607. https://doi.org/10.4025/actascitechnol.v40i1.36607
Tseng L-Y, Chin Y-H, Wang S-C (2009) A minimized makespan scheduler with multiple factors for grid computing systems. Exp Syst Appl 36(8):11118–11130. https://doi.org/10.1016/j.eswa.2009.02.071
Ulaga L, Đurasević M, Jakobović D (2022) Local search based methods for scheduling in the unrelated parallel machines environment. Exp Syst Appl. https://doi.org/10.1016/j.eswa.2022.116909
Vallada E, Ruiz R (2011) A genetic algorithm for the unrelated parallel machine scheduling problem with sequence dependent setup times. Eur J Oper Res 211(3):612–622. https://doi.org/10.1016/j.ejor.2011.01.011
Vallada E, Villa F, Fanjul-Peyro L (2019) Enriched metaheuristics for the resource constrained unrelated parallel machine scheduling problem. Comput Oper Res 111:415–424. https://doi.org/10.1016/j.cor.2019.07.016
Van Hop N, Nagarur NN (2004) The scheduling problem of PCBS for multiple non-identical parallel machines. Eur J Oper Res 158(3):577–594. https://doi.org/10.1016/S0377-2217(03)00376-X
Van BK, Hop NV (2021) Genetic algorithm with initial sequence for parallel machines scheduling with sequence dependent setup times based on earliness- tardiness. J Ind Prod Eng 38(1):18–28. https://doi.org/10.1080/21681015.2020.1829111
Villa F, Vallada E, Fanjul-Peyro L (2018) Heuristic algorithms for the unrelated parallel machine scheduling problem with one scarce additional resource. Exp Syst Appl 93:28–38. https://doi.org/10.1016/j.eswa.2017.09.054
Vlašić I, Đurasević M, Jakobović D (2019) Improving genetic algorithm performance by population initialisation with dispatching rules. Comput Ind Eng 137:106030. https://doi.org/10.1016/j.cie.2019.106030
Vlašić I, Đurasević M, Jakobović D (2020) A comparative study of solution representations for the unrelated machines environment. Comput Oper Res 123:105005. https://doi.org/10.1016/j.cor.2020.105005
Vredeveld T, Hurkens C (2002) Experimental comparison of approximation algorithms for scheduling unrelated parallel machines. INFORMS J Comput 14(2):175–189. https://doi.org/10.1287/ijoc.14.2.175.119
Wang H, Alidaee B (2019) Effective heuristic for large-scale unrelated parallel machines scheduling problems. Omega 83:261–274. https://doi.org/10.1016/j.omega.2018.07.005
Wang M, Pan G (2019) A novel imperialist competitive algorithm with multi-elite individuals guidance for multi-object unrelated parallel machine scheduling problem. IEEE Access 7:121223–121235. https://doi.org/10.1109/ACCESS.2019.2937747
Wang I-L, Wang Y-C, Chen C-W (2012) Scheduling unrelated parallel machines in semiconductor manufacturing by problem reduction and local search heuristics. Flex Servi Manuf J 25(3):343–366. https://doi.org/10.1007/s10696-012-9150-7
Wang W-L, Wang H-Y, Zhao Y-W, Zhang L-P, Xu X-L (2013) Parallel machine scheduling with splitting jobs by a hybrid differential evolution algorithm. Comput Oper Res 40(5):1196–1206. https://doi.org/10.1016/j.cor.2012.12.007
Wang L, Wang S, Zheng X (2016) A hybrid estimation of distribution algorithm for unrelated parallel machine scheduling with sequence-dependent setup times. IEEE/CAA J Autom Sin 3(3):235–246. https://doi.org/10.1109/JAS.2016.7508797
Wang M-Z, Zhang L-L, Choi T-M (2020) Bi-objective optimal scheduling with raw material’s shelf-life constraints in unrelated parallel machines production. IEEE Trans Syst Man Cybern: Syst 50(11):4598–4610. https://doi.org/10.1109/TSMC.2018.2855700
Wang X, Li Z, Chen Q, Mao N (2020) Meta-heuristics for unrelated parallel machines scheduling with random rework to minimize expected total weighted tardiness. Comput Ind Eng 145:106505. https://doi.org/10.1016/j.cie.2020.106505
Weng MX, Lu J, Ren H (2001) Unrelated parallel machine scheduling with setup consideration and a total weighted completion time objective. Int J Prod Econ 70(3):215–226. https://doi.org/10.1016/S0925-5273(00)00066-9
Wolpert D, Macready W (1997) No free lunch theorems for optimization. IEEE Trans Evolut Comput 1(1):67–82. https://doi.org/10.1109/4235.585893
Wotzlaw A (2007) Scheduling unrelated parallel machines-algorithms, complexity, and performance. VDM Verlag, Saarbrücken, DEU
Wu M-Y, Shu W (2001) A high-performance mapping algorithm for heterogeneous computing systems. In: Proceedings 15th international parallel and distributed processing symposium. IPDPS 2001. https://doi.org/10.1109/IPDPS.2001.925020
Wu X, Che A (2019) A memetic differential evolution algorithm for energy-efficient parallel machine scheduling. Omega 82:155–165. https://doi.org/10.1016/j.omega.2018.01.001
Wu L, Wang S (2018) Exact and heuristic methods to solve the parallel machine scheduling problem with multi-processor tasks. Int J Prod Econ 201:26–40. https://doi.org/10.1016/j.ijpe.2018.04.013
Xhafa F, Barolli L, Durresi A (2007) Batch mode scheduling in grid systems. IJWGS 3:19–37. https://doi.org/10.1504/IJWGS.2007.012635
Xu X, Ma Y, Zhou Z, Zhao Y (2015) Customer order scheduling on unrelated parallel machines to minimize total completion time. IEEE Trans Autom Sci Eng 12(1):244–257. https://doi.org/10.1109/TASE.2013.2291899
Xu S, Bean JC (2007) A genetic algorithm for scheduling parallel non-identical batch processing machines. In: 2007 IEEE symposium on computational intelligence in scheduling, pp 143–150. https://doi.org/10.1109/SCIS.2007.367682
Xue Y, Jiang P, Neri F, Liang J (2021) A multi-objective evolutionary approach based on graph-in-graph for neural architecture search of convolutional neural networks. Int J Neural Syst 31(09):2150035. https://doi.org/10.1142/s0129065721500350
Xue Y, Wang Y, Liang J, Slowik A (2021) A self-adaptive mutation neural architecture search algorithm based on blocks. IEEE Comput Intell Mag 16(3):67–78. https://doi.org/10.1109/MCI.2021.3084435
Xue Y, Tang Y, Xu X, Liang J, Neri F (2022) Multi-objective feature selection with missing data in classification. IEEE Trans Emerg Top Comput Intell 6(2):355–364. https://doi.org/10.1109/TETCI.2021.3074147
Yang-Kuei L, Chi-Wei L (2013) Dispatching rules for unrelated parallel machine scheduling with release dates. Int J Adv Manuf Technol 67(1–4):269–279. https://doi.org/10.1007/s00170-013-4773-8
Yaser Zarook, Javad Rezaeian, Iraj Mahdavi, Masoud Yaghini (2021) Efficient algorithms to minimize makespan of the unrelated parallel batch-processing machines scheduling problem with unequal job ready times. RAIRO-Oper Res 55(3):1501–1522. https://doi.org/10.1051/ro/2021062
Yepes-Borrero JC, Villa F, Perea F, Caballero-Villalobos JP (2020) Grasp algorithm for the unrelated parallel machine scheduling problem with setup times and additional resources. Exp Syst Appl 141:112959. https://doi.org/10.1016/j.eswa.2019.112959
Yepes-Borrero JC, Perea F, Ruiz R, Villa F (2021) Bi-objective parallel machine scheduling with additional resources during setups. Eur J Oper Res 292(2):443–455. https://doi.org/10.1016/j.ejor.2020.10.052
Yildirim M, Duman E, Krishnan K, Senniappan K (2007) Parallel machine scheduling with load balancing and sequence dependent setups. Int J Oper Res (Taichung) 1
Ying K-C, Lin S-W (2012) Unrelated parallel machine scheduling with sequence-and machine-dependent setup times and due date constraints. Int J Innov Comput Inf Control 8:3279–3297
Ying K-C, Lee Z-J, Lin S-W (2010) Makespan minimization for scheduling unrelated parallel machines with setup times. J Intell Manuf 23(5):1795–1803. https://doi.org/10.1007/s10845-010-0483-3
Yu L, Shih HM, Pfund M, Carlyle WM, Fowler JW (2002) IIE Transactions 34(11):921–931. https://doi.org/10.1023/a:1016185412209
Zeidi JR, MohammadHosseini S (2015) Scheduling unrelated parallel machines with sequence-dependent setup times. Int J Adv Manuf Technol 81(9–12):1487–1496. https://doi.org/10.1007/s00170-015-7215-y
Zhang Z, Zheng L, Weng MX (2006) Dynamic parallel machine scheduling with mean weighted tardiness objective by q-learning. Int J Adv Manuf Technol 34(9–10):968–980. https://doi.org/10.1007/s00170-006-0662-8
Zhang L, Deng Q, Lin R, Gong G, Han W (2021) A combinatorial evolutionary algorithm for unrelated parallel machine scheduling problem with sequence and machine-dependent setup times, limited worker resources and learning effect. Exp Syst Appl 175:114843. https://doi.org/10.1016/j.eswa.2021.114843
Zheng X-L, Wang L (2018) A collaborative multiobjective fruit fly optimization algorithm for the resource constrained unrelated parallel machine green scheduling problem. IEEE Trans Syst Man Cybern: Syst 48(5):790–800. https://doi.org/10.1109/TSMC.2016.2616347
Zhou S, Xie J, Du N, Pang Y (2018) A random-keys genetic algorithm for scheduling unrelated parallel batch processing machines with different capacities and arbitrary job sizes. Appl Math Comput 334:254–268. https://doi.org/10.1016/j.amc.2018.04.024
Zhou H, Li Z, Wu X (2007) Scheduling unrelated parallel machine to minimize total weighted tardiness using ant colony optimization. In: 2007 IEEE international conference on automation and logistics, pp 132–136. https://doi.org/10.1109/ICAL.2007.4338544
Funding
This work has been supported in part by Croatian Science Foundation under the project IP-2019-04-4333.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflicts of interest/Competing interests
Not applicable
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Ɖurasević, M., Jakobović, D. Heuristic and metaheuristic methods for the parallel unrelated machines scheduling problem: a survey. Artif Intell Rev 56, 3181–3289 (2023). https://doi.org/10.1007/s10462-022-10247-9
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10462-022-10247-9