{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T18:41:16Z","timestamp":1775068876350,"version":"3.50.1"},"reference-count":56,"publisher":"MDPI AG","issue":"14","license":[{"start":{"date-parts":[[2022,7,12]],"date-time":"2022-07-12T00:00:00Z","timestamp":1657584000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001871","name":"FCT\u2014Funda\u00e7\u00e3o para a Ci\u00eancia e Tecnologia","doi-asserted-by":"publisher","award":["UIDB\/00319\/2020"],"award-info":[{"award-number":["UIDB\/00319\/2020"]}],"id":[{"id":"10.13039\/501100001871","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001871","name":"FCT\u2014Funda\u00e7\u00e3o para a Ci\u00eancia e Tecnologia","doi-asserted-by":"publisher","award":["EXPL\/EME-SIS\/1224\/2021"],"award-info":[{"award-number":["EXPL\/EME-SIS\/1224\/2021"]}],"id":[{"id":"10.13039\/501100001871","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001871","name":"FCT\u2014Funda\u00e7\u00e3o para a Ci\u00eancia e Tecnologia","doi-asserted-by":"publisher","award":["UI\/BD\/150936\/2021"],"award-info":[{"award-number":["UI\/BD\/150936\/2021"]}],"id":[{"id":"10.13039\/501100001871","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematics"],"abstract":"<jats:p>Manufacturing scheduling aims to optimize one or more performance measures by allocating a set of resources to a set of jobs or tasks over a given period of time. It is an area that considers a very important decision-making process for manufacturing and production systems. In this paper, the unrelated parallel machine scheduling problem with machine-dependent and job-sequence-dependent setup times is addressed. This problem involves the scheduling of tasks on unrelated machines with setup times in order to minimize the makespan. The genetic algorithm is used to solve small and large instances of this problem when processing and setup times are balanced (Balanced problems), when processing times are dominant (Dominant P problems), and when setup times are dominant (Dominant S problems). For small instances, most of the values achieved the optimal makespan value, and, when compared to the metaheuristic ant colony optimization (ACOII) algorithm referred to in the literature, it was found that there were no significant differences between the two methods. However, in terms of large instances, there were significant differences between the optimal makespan obtained by the two methods, revealing overall better performance by the genetic algorithm for Dominant S and Dominant P problems.<\/jats:p>","DOI":"10.3390\/math10142431","type":"journal-article","created":{"date-parts":[[2022,7,12]],"date-time":"2022-07-12T20:52:41Z","timestamp":1657659161000},"page":"2431","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["A Statistical Comparison of Metaheuristics for Unrelated Parallel Machine Scheduling Problems with Setup Times"],"prefix":"10.3390","volume":"10","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4004-9901","authenticated-orcid":false,"given":"Ana Rita","family":"Antunes","sequence":"first","affiliation":[{"name":"ALGORITMI Center, University of Minho, 4710-057 Braga, Portugal"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5387-8771","authenticated-orcid":false,"given":"Marina A.","family":"Matos","sequence":"additional","affiliation":[{"name":"ALGORITMI Center, University of Minho, 4710-057 Braga, Portugal"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8679-2886","authenticated-orcid":false,"given":"Ana Maria A. C.","family":"Rocha","sequence":"additional","affiliation":[{"name":"ALGORITMI Center, University of Minho, 4710-057 Braga, Portugal"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4772-4404","authenticated-orcid":false,"given":"Lino A.","family":"Costa","sequence":"additional","affiliation":[{"name":"ALGORITMI Center, University of Minho, 4710-057 Braga, Portugal"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2299-1859","authenticated-orcid":false,"given":"Leonilde R.","family":"Varela","sequence":"additional","affiliation":[{"name":"ALGORITMI Center, University of Minho, 4710-057 Braga, Portugal"}]}],"member":"1968","published-online":{"date-parts":[[2022,7,12]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1016\/j.cirp.2017.04.003","article-title":"Increasing data integrity for improving decision making in production planning and control","volume":"66","author":"Schuh","year":"2017","journal-title":"CIRP Ann."},{"key":"ref_2","unstructured":"Pinedo, M.L. (2016). Scheduling Theory, Algorithms, and Systems, Springer. [5th ed.]."},{"key":"ref_3","first-page":"145","article-title":"An ordered heuristic for the allocation of resources in unrelated paral-lel-machines","volume":"6","author":"Santos","year":"2015","journal-title":"Int. J. Ind. Eng. Comput."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1016\/j.cie.2012.04.020","article-title":"A minimum-cost network flow approach to preemptive parallel-machine scheduling","volume":"64","author":"Su","year":"2013","journal-title":"Comput. Ind. Eng."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/j.ejor.2011.02.006","article-title":"Parallel machines scheduling with machine maintenance for minsum criteria","volume":"212","author":"Tan","year":"2011","journal-title":"Eur. J. Oper. Res."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"612","DOI":"10.1016\/j.ejor.2011.01.011","article-title":"A genetic algorithm for the unrelated parallel machine scheduling problem with sequence dependent setup times","volume":"211","author":"Vallada","year":"2011","journal-title":"Eur. J. Oper. Res."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/s10845-005-5514-0","article-title":"Heuristics for the Unrelated Parallel Machine Scheduling Problem with Setup Times","volume":"17","author":"Rabadi","year":"2006","journal-title":"J. Intell. Manuf."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"693","DOI":"10.1007\/s10845-009-0246-1","article-title":"A two-stage Ant Colony Optimization algorithm to minimize the makespan on unrelated parallel machines with sequence-dependent setup times","volume":"21","author":"Arnaout","year":"2009","journal-title":"J. Intell. Manuf."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/s10845-012-0672-3","article-title":"A two-stage Ant Colony optimization algorithm to minimize the makespan on unrelated parallel machines\u2014part II: Enhancements and experimentations","volume":"25","author":"Arnaout","year":"2012","journal-title":"J. Intell. Manuf."},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Yang, Q., Guo, X., Gao, X.-D., Xu, D.-D., and Lu, Z.-Y. (2022). Differential Elite Learning Particle Swarm Optimization for Global Numerical Optimization. Mathematics, 10.","DOI":"10.3390\/math10081261"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"189527","DOI":"10.1109\/ACCESS.2020.3031002","article-title":"A Hybrid Leader Selection Strategy for Many-Objective Particle Swarm Optimization","volume":"8","author":"Leung","year":"2020","journal-title":"IEEE Access"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1109\/TEVC.2010.2059031","article-title":"Differential Evolution: A Survey of the State-of-the-Art","volume":"15","author":"Das","year":"2011","journal-title":"IEEE Trans. Evol. Comput."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"795","DOI":"10.1016\/j.cie.2008.03.003","article-title":"A discrete differential evolution algorithm for the permutation flowshop scheduling problem","volume":"55","author":"Pan","year":"2008","journal-title":"Comput. Ind. Eng."},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Ho, M.H., Hnaien, F., and Dugardinr, F. (2022). Exact method to optimize the total electricity cost in two-machine permutation flow shop scheduling problem under Time-of-use tariff. Comput. Oper. Res., 144.","DOI":"10.1016\/j.cor.2022.105788"},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Foumani, M., Razeghi, A., and Smith-Miles, K. (2020). Stochastic optimization of two-machine flow shop robotic cells with con-trollable inspection times: From theory toward practice. Robot. Comput.-Integr. Manuf., 61.","DOI":"10.1016\/j.rcim.2019.101822"},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Artiba, A., and Elmaghraby, S.E. (1996). The Planning and Scheduling of Production Systems, Springer Science & Business Media.","DOI":"10.1007\/978-1-4613-1195-9"},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Brucker, P. (2001). Due-date scheduling. Scheduling Algorithms, Springer.","DOI":"10.1007\/978-3-662-04550-3"},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/mnsc.6.1.1","article-title":"Scheduling with Deadlines and Loss Functions","volume":"6","author":"McNaughton","year":"1959","journal-title":"Manag. Sci."},{"key":"ref_19","first-page":"373","article-title":"An exact extended formulation for the unrelated parallel machine total weighted completion time problem","volume":"20","year":"2016","journal-title":"J. Sched."},{"key":"ref_20","first-page":"681","article-title":"A hybrid algorithm for unrelated parallel machines scheduling","volume":"7","author":"Nikabadi","year":"2016","journal-title":"Int. J. Ind. Eng. Comput."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/j.cie.2017.06.014","article-title":"Investigation of reconfiguration effect on makespan with social network method for flexible job shop scheduling problem","volume":"110","author":"Reddy","year":"2017","journal-title":"Comput. Ind. Eng."},{"key":"ref_22","unstructured":"Varela, M.L.R., and Silva, S.D.C. (2008, January 23\u201325). An ontology for a model of manufacturing scheduling problems to be solved on the web. Proceedings of the International Conference on Information Technology for Balanced Automation Systems, Porto, Portugal."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/j.cie.2017.05.007","article-title":"A rule-based genetic algorithm with an improvement heuristic for unrelated parallel machine scheduling problem with time-dependent deterioration and multiple rate-modifying activities","volume":"109","author":"Woo","year":"2017","journal-title":"Comput. Ind. Eng."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1080\/00207543.2015.1005768","article-title":"Dynamic order acceptance and scheduling problem with sequence-dependent setup time","volume":"53","author":"Xu","year":"2015","journal-title":"Int. J. Prod. Res."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"4815","DOI":"10.1080\/00207543.2015.1098786","article-title":"Studying the impact of sequence-dependent set-up times in integrated process planning and scheduling with E-ACO heuristic","volume":"54","author":"Zhang","year":"2015","journal-title":"Int. J. Prod. Res."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1016\/j.ejor.2015.04.004","article-title":"The third comprehensive survey on scheduling problems with setup times\/costs","volume":"246","author":"Allahverdi","year":"2015","journal-title":"Eur. J. Oper. Res."},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"Baker, K.R., and Trietsch, D. (2009). Principles of Sequencing and Scheduling, John Wiley & Sons, Inc.","DOI":"10.1002\/9780470451793"},{"key":"ref_28","doi-asserted-by":"crossref","unstructured":"Graham, R.L., Lawler, E.L., Lenstra, J.K., and Kan, A.H.G.R. (1979). Optimization and Approximation in Deterministic Se-Quencing and Scheduling, Elsevier.","DOI":"10.1016\/S0167-5060(08)70356-X"},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0377-2217(95)00362-2","article-title":"The job shop scheduling problem: Conventional and new solution techniques","volume":"93","author":"Blazewicz","year":"1996","journal-title":"Eur. J. Oper. Res."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1023\/B:ANOR.0000030682.25673.c0","article-title":"Scheduling Malleable Tasks on Parallel Processors to Minimize the Makespan","volume":"129","author":"Machowiak","year":"2004","journal-title":"Ann. Oper. Res."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/s00170-010-2824-y","article-title":"Minimization of total tardiness on unrelated parallel machines with sequence- and machine-dependent setup times under due date constraints","volume":"53","author":"Lin","year":"2010","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"1487","DOI":"10.1007\/s00170-015-7215-y","article-title":"Scheduling unrelated parallel machines with sequence-dependent setup times","volume":"81","author":"Zeidi","year":"2015","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"358","DOI":"10.1016\/j.cor.2007.10.004","article-title":"A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria","volume":"36","author":"Jungwattanakit","year":"2009","journal-title":"Comput. Oper. Res."},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/S0377-2217(00)00197-1","article-title":"A divide and merge heuristic for the multiprocessor scheduling problem with sequence dependent setup times","volume":"133","author":"Gendreau","year":"2001","journal-title":"Eur. J. Oper. Res."},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/S0736-5845(02)00013-3","article-title":"Unrelated parallel machine scheduling with setup times using simulated annealing","volume":"18","author":"Kim","year":"2002","journal-title":"Robot. Comput. Manuf."},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"715","DOI":"10.1016\/j.ejor.2008.09.025","article-title":"Simultaneously scheduling multiple turns for steel color-coating production","volume":"198","author":"Tang","year":"2009","journal-title":"Eur. J. Oper. Res."},{"key":"ref_37","first-page":"230","article-title":"A Survey Of Algorithms For Single And Multi-Objective Unrelated Parallel-Machine Deterministic Scheduling Problems","volume":"21","author":"Pfund","year":"2004","journal-title":"J. Chin. Inst. Ind. Eng."},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/S0736-5845(02)00077-7","article-title":"Unrelated parallel machine scheduling with setup times and a total weighted tardiness objective","volume":"19","author":"Kim","year":"2003","journal-title":"Robot. Comput. Manuf."},{"key":"ref_39","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1016\/j.ejor.2004.04.015","article-title":"Makespan minimization for scheduling unrelated parallel machines: A recovering beam search approach","volume":"165","author":"Ghirardi","year":"2005","journal-title":"Eur. J. Oper. Res."},{"key":"ref_40","doi-asserted-by":"crossref","first-page":"790","DOI":"10.1109\/TSMC.2016.2616347","article-title":"A Collaborative Multiobjective Fruit Fly Optimization Algorithm for the Resource Constrained Unrelated Parallel Machine Green Scheduling Problem","volume":"48","author":"Zheng","year":"2016","journal-title":"IEEE Trans. Syst. Man, Cybern. Syst."},{"key":"ref_41","doi-asserted-by":"crossref","first-page":"7541","DOI":"10.1080\/00207543.2017.1387300","article-title":"Minimising maximum tardiness in assembly flowshops with setup times","volume":"55","author":"Aydilek","year":"2017","journal-title":"Int. J. Prod. Res."},{"key":"ref_42","doi-asserted-by":"crossref","first-page":"1715","DOI":"10.1109\/TLA.2018.8444391","article-title":"A Hybrid Genetic Algorithm for Solving the Unrelated Parallel Machine Scheduling Problem with Sequence Dependent Setup Times","volume":"16","author":"Abreu","year":"2018","journal-title":"IEEE Lat. Am. Trans."},{"key":"ref_43","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/j.cie.2018.05.014","article-title":"A constraint programming approach for solving unrelated parallel machine scheduling problem","volume":"121","author":"Gedik","year":"2018","journal-title":"Comput. Ind. Eng."},{"key":"ref_44","doi-asserted-by":"crossref","first-page":"482","DOI":"10.1016\/j.ejor.2017.01.002","article-title":"Models and matheuristics for the unrelated parallel machine scheduling problem with additional resources","volume":"260","author":"Perea","year":"2017","journal-title":"Eur. J. Oper. Res."},{"key":"ref_45","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/s10479-019-03138-w","article-title":"A worm optimization algorithm to minimize the makespan on unrelated parallel machines with sequence-dependent setup times","volume":"285","author":"Arnaout","year":"2019","journal-title":"Ann. Oper. Res."},{"key":"ref_46","doi-asserted-by":"crossref","unstructured":"Amaral, G., Costa, L., Rocha, A.M.A.C., Varela, L., and Madureira, A. (2019). Application of the Simulated Annealing Algorithm to Minimize the makespan on the Unrelated Parallel Machine Scheduling Problem with Setup Times. International Conference on Hybrid Intelligent Systems, Springer.","DOI":"10.1007\/978-3-030-14347-3_39"},{"key":"ref_47","doi-asserted-by":"crossref","unstructured":"Rabadi, G. (2016). Heuristics, Metaheuristics and Approximate Methods in Planning and Scheduling, Springer.","DOI":"10.1007\/978-3-319-26024-2"},{"key":"ref_48","doi-asserted-by":"crossref","first-page":"655","DOI":"10.1057\/jors.1991.132","article-title":"Textile production systems: A succession of non-identical parallel processor shops","volume":"42","author":"Guinet","year":"1991","journal-title":"J. Oper. Res. Soc."},{"key":"ref_49","unstructured":"(2022, January 17). Scheduling Research Virtual Center Homepage. Available online: www.SchedulingResearch.com."},{"key":"ref_50","unstructured":"Holland, J.H. (1975). Adaptation in Natural and Artificial Systems, University of Michigan Press. [1st ed.]."},{"key":"ref_51","doi-asserted-by":"crossref","first-page":"8091","DOI":"10.1007\/s11042-020-10139-6","article-title":"A review on genetic algorithm: Past, present, and future","volume":"80","author":"Katoch","year":"2021","journal-title":"Multimed. Tools Appl."},{"key":"ref_52","doi-asserted-by":"crossref","unstructured":"Lambora, A., Gupta, K., and Chopra, K. (2019, January 14\u201316). Genetic Algorithm\u2014A Literature Review. Proceedings of the 2019 International Conference on Machine Learning, Big Data, Cloud and Parallel Computing (COMITCon), Faridabad, India.","DOI":"10.1109\/COMITCon.2019.8862255"},{"key":"ref_53","doi-asserted-by":"crossref","unstructured":"Teoh, T.T., and Rong, Z. (2022). Python for Data Analysis. Artificial Intelligence with Python, Springer.","DOI":"10.1007\/978-981-16-8615-3"},{"key":"ref_54","first-page":"1","article-title":"Scikit-network: Graph analysis in python","volume":"21","author":"Bonald","year":"2020","journal-title":"J. Mach. Learn Res."},{"key":"ref_55","unstructured":"Montgomery, D.C., and Runger, G.C. (2018). Applied Statistics and Probability for Engineers, Wiley."},{"key":"ref_56","doi-asserted-by":"crossref","first-page":"3021","DOI":"10.21105\/joss.03021","article-title":"Seaborn: Statistical data visualization","volume":"6","author":"Waskom","year":"2021","journal-title":"J. Open Source Softw."}],"container-title":["Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2227-7390\/10\/14\/2431\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T23:48:54Z","timestamp":1760140134000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2227-7390\/10\/14\/2431"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,12]]},"references-count":56,"journal-issue":{"issue":"14","published-online":{"date-parts":[[2022,7]]}},"alternative-id":["math10142431"],"URL":"https:\/\/doi.org\/10.3390\/math10142431","relation":{},"ISSN":["2227-7390"],"issn-type":[{"value":"2227-7390","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,7,12]]}}}