{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T18:40:45Z","timestamp":1775068845707,"version":"3.50.1"},"reference-count":49,"publisher":"MDPI AG","issue":"9","license":[{"start":{"date-parts":[[2021,8,26]],"date-time":"2021-08-26T00:00:00Z","timestamp":1629936000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Symmetry"],"abstract":"<jats:p>Unrelated parallel machine scheduling problems (UPMSP) with various processing constraints have been considered fully; however, a UPMSP with deteriorating preventive maintenance (PM) and sequence-dependent setup time (SDST) is seldom considered. In this study, a new differentiated shuffled frog-leaping algorithm (DSFLA) is presented to solve the problem with makespan minimization. The whole search procedure consists of two phases. In the second phase, quality evaluation is done on each memeplex, then the differentiated search processes are implemented between good memeplexes and other ones, and a new population shuffling is proposed. We conducted a number of experiments. The computational results show that the main strategies of DSFLA were effective and reasonable and DSFLA was very competitive at solving UPMSP with deteriorating PM and SDST.<\/jats:p>","DOI":"10.3390\/sym13091574","type":"journal-article","created":{"date-parts":[[2021,8,31]],"date-time":"2021-08-31T22:58:15Z","timestamp":1630450695000},"page":"1574","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["A Novel Shuffled Frog-Leaping Algorithm for Unrelated Parallel Machine Scheduling with Deteriorating Maintenance and Setup Time"],"prefix":"10.3390","volume":"13","author":[{"given":"Deming","family":"Lei","sequence":"first","affiliation":[{"name":"School of Automation, Wuhan University of Technology, Wuhan 430000, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tian","family":"Yi","sequence":"additional","affiliation":[{"name":"School of Automation, Wuhan University of Technology, Wuhan 430000, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2021,8,26]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"106630","DOI":"10.1016\/j.cie.2020.106630","article-title":"Insertion of new idle time for unrelated parallel machine scheduling with job splititing and machine breakdown","volume":"147","author":"Kim","year":"2020","journal-title":"Comput. Ind. Eng."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"106505","DOI":"10.1016\/j.cie.2020.106505","article-title":"Meta-heuristics for unrelated parallel machines scheduling with random rework to minimize expected total weighted tardiness","volume":"145","author":"Wang","year":"2020","journal-title":"Comput. Ind. Eng."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/j.cor.2018.10.016","article-title":"Parallel machine scheduling with completion-time based criteria and sequence-dependent deterioration","volume":"103","author":"Ding","year":"2019","journal-title":"Comput. Oper. Res."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1016\/j.cie.2015.02.012","article-title":"An integrated three-stage maintenance scheduling model for unrelated parallel machines with aging effect and multimaintenance activities","volume":"83","author":"Tavana","year":"2015","journal-title":"Comput. Ind. Eng."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"1458","DOI":"10.1016\/j.cor.2011.08.017","article-title":"Unrelated parallel-machine scheduling with aging effects and multi-maintenance activities","volume":"39","author":"Yang","year":"2013","journal-title":"Comput. Oper. Res."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1016\/j.jmsy.2015.07.002","article-title":"Multi-objective optimization of parallel machine scheduling integrated with multi-resources preventive maintenance planning","volume":"37","author":"Wang","year":"2015","journal-title":"J. Manuf. Syst."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1016\/j.ejor.2015.12.047","article-title":"Parallel-machine scheduling with maintenance: Praising the assignment problem","volume":"252","author":"Finke","year":"2016","journal-title":"Eur. J. Oper. Res."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"106320","DOI":"10.1016\/j.cie.2020.106320","article-title":"An artificial bee colony with division for distributed unrelated parallel machine scheduling with preventive maintenance","volume":"141","author":"Lei","year":"2020","journal-title":"Comput. Ind. Eng."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"602","DOI":"10.1016\/j.cie.2010.12.017","article-title":"Unrelated parallel-machine scheduling with deteriorating maintenance activities","volume":"60","author":"Cheng","year":"2011","journal-title":"Comput. Ind. Eng."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/j.ins.2013.08.053","article-title":"Unrelated parallel-machine scheduling problems with aging effects and deteriorating maintenance activities","volume":"253","author":"Hsu","year":"2013","journal-title":"Infor. Sci."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1016\/j.asoc.2018.02.018","article-title":"A hybrid ABC-TS algorithm for the unrelated parallel-batching machines scheduling problem with deteriorating jobs and maintenance activity","volume":"66","author":"Lu","year":"2018","journal-title":"Appl. Soft. Comput."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/S0305-0483(98)00042-5","article-title":"A review of scheduling research involving setup considerations","volume":"27","author":"Allahverdi","year":"1999","journal-title":"Omega"},{"key":"ref_13","first-page":"155","article-title":"On the use of a vehicle routing algorithm for the parallel processor problem with sequence dependent changeover costs","volume":"9","author":"Parker","year":"1977","journal-title":"IIE Trans."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"3747","DOI":"10.1080\/00207540110064938","article-title":"Heuristic scheduling of parallel machines with sequence-dependent set-up times","volume":"39","author":"Kurz","year":"2001","journal-title":"Int. J. Prod. Res."},{"key":"ref_15","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":"2010","journal-title":"J. Intell. Manuf."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"612","DOI":"10.1016\/j.ejor.2011.01.011","article-title":"A genetic algorithm for the unrelated machine scheduling problem with sequence dependent setup times","volume":"211","author":"Vallada","year":"2011","journal-title":"Eur. J. Oper. Res."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1016\/j.cor.2014.05.013","article-title":"ABC-based manufacturing scheduling for unrelated parallel machines with machine-dependent and job sequence-dependent setup times","volume":"51","author":"Lin","year":"2014","journal-title":"Comput. Oper. Res."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"2105","DOI":"10.1007\/s00170-014-6614-9","article-title":"An artificial bee colony algorithm approach for unrelated parallel machine scheduling with processing set restrictions, job sequence-dependent setup times, and due date","volume":"77","author":"Caniyilmaz","year":"2015","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1016\/j.neucom.2014.06.091","article-title":"An immune-inspired algorithm for an unrelated parallel machines scheduling problem with sequence and machine dependent setup-times for makespan minimisation","volume":"163","author":"Diana","year":"2015","journal-title":"Neurocomputing"},{"key":"ref_20","first-page":"235","article-title":"A hybrid estimation of distribution algorithm for unrelated parallel machine scheduling with sequence-dependent setup times","volume":"3","author":"Wang","year":"2016","journal-title":"IEEE-CAA J. Autom."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"54459","DOI":"10.1109\/ACCESS.2018.2872110","article-title":"An improved firefly algorithm for the unrelated parallel machines scheduling problem with sequence-dependent setup times","volume":"4","author":"Ezugwu","year":"2018","journal-title":"IEEE Acc."},{"key":"ref_22","first-page":"1173","article-title":"Reformulations and an exact algorithm for unrelated parallel machine scheduling problems with setup times","volume":"10","author":"Ruiz","year":"2019","journal-title":"Comput. Oper. Res."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1016\/j.cor.2018.10.010","article-title":"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","volume":"103","author":"Bektur","year":"2019","journal-title":"Comput. Oper. Res."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"996","DOI":"10.1111\/itor.12566","article-title":"Bi-criteria formulation for green scheduling with unrelated parallel machines with sequence-depedent setup times","volume":"28","author":"Cota","year":"2021","journal-title":"Int. Trans. Oper. Res."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1016\/j.cie.2018.07.006","article-title":"Including preventive maintenance activities in an unrelated parallel machine environment with dependent setup times","volume":"123","author":"Alvarez","year":"2018","journal-title":"Comput. Ind. Eng."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"121223","DOI":"10.1109\/ACCESS.2019.2937747","article-title":"A novel imperialist competitive algoirthm with multi-elite individuals guidance for multi-objective unrelated parallel machine scheduling problem","volume":"7","author":"Wang","year":"2019","journal-title":"IEEE Acc."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1080\/03052150500384759","article-title":"Shuffled frog-leaping algorithm: A memetic meta-heuristic for discrete optimization","volume":"38","author":"Eusuff","year":"2006","journal-title":"Eng. Optim."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1007\/s00500-007-0210-y","article-title":"Solving a bi-criteria permutation flow-shop problem using shuffled frog-leaping algorithm","volume":"12","author":"Mirzaei","year":"2008","journal-title":"Appl. Soft. Comput."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"699","DOI":"10.1007\/s00170-010-2775-3","article-title":"An effective shuffled frog-leaping algorithm for lot-streaming flow shop scheduling problem","volume":"52","author":"Pan","year":"2011","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"ref_30","first-page":"9353","article-title":"An effective shuffled frog-leaping algorithm for multi-objective flexible job shop scheduling problems","volume":"218","author":"Li","year":"2012","journal-title":"Appl. Math. Comput."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"1529","DOI":"10.1007\/s00170-013-4940-y","article-title":"An effective shuffled frog-leaping algorithm for hybrid flow-shop scheduling with multiprocessor tasks","volume":"68","author":"Xu","year":"2013","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"9333","DOI":"10.1016\/j.eswa.2015.08.025","article-title":"A shuffled frog-leaping algorithm for hybrid flow shop scheduling with two agents","volume":"42","author":"Lei","year":"2015","journal-title":"Expert Syst. Appl."},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"4793","DOI":"10.1080\/00207543.2015.1088970","article-title":"A shuffled frog-leaping algorithm for job shop scheduling with outsourcing options","volume":"54","author":"Lei","year":"2016","journal-title":"Int. J. Prod. Res."},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"3126","DOI":"10.1080\/00207543.2016.1262082","article-title":"A shuffled frog-leaping algorithm for flexible job shop scheduling with the consideration of energy consumption","volume":"55","author":"Lei","year":"2017","journal-title":"Int. J. Prod. Res."},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"1461","DOI":"10.1080\/0305215X.2019.1674295","article-title":"Solving distributed two-stage hybrid flowshop scheduling using a shuffled frog-leaping algorithm with memeplex grouping","volume":"52","author":"Lei","year":"2020","journal-title":"Eng. Optim."},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"103540","DOI":"10.1016\/j.engappai.2020.103540","article-title":"Dynamic shuffled frog-leaping algorithm for distributed hybrid flow shop scheduling with multiprocessor tasks","volume":"90","author":"Cai","year":"2020","journal-title":"Eng. Appl. Artif. Intell."},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"693","DOI":"10.1007\/s10898-018-0705-3","article-title":"Parallel-batching scheduling with nonlinear processing times on a single and unrelated parallel machines","volume":"78","author":"Kong","year":"2020","journal-title":"J. Glob. Optim."},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"19","DOI":"10.3390\/a8010019","article-title":"An improved shuffled frog-leaping algorithm for flexible job shop scheduling problem","volume":"8","author":"Lu","year":"2015","journal-title":"Algorithms"},{"key":"ref_39","doi-asserted-by":"crossref","first-page":"6384","DOI":"10.3390\/en13236384","article-title":"Optimal dynamic scheduling of electric vehicles in a parking lot using particle swarm optimization and shuffled frog leaping algorithm","volume":"13","author":"Fernez","year":"2020","journal-title":"Energies"},{"key":"ref_40","doi-asserted-by":"crossref","unstructured":"Yang, W., Ho, S.L., and Fu, W. (2020). A modified shuffled frog leaping algorithm for the topology optimization of electromagnet devices. Appl. Sci., 10.","DOI":"10.3390\/app10186186"},{"key":"ref_41","doi-asserted-by":"crossref","unstructured":"Moayedi, H., Bui, D.T., and Thi Ngo, P.T. (2020). Shuffled frog leaping algorithm and wind-driven optimization technique modified with multilayer perceptron. Appl. Sci., 10.","DOI":"10.3390\/app10020689"},{"key":"ref_42","doi-asserted-by":"crossref","unstructured":"Hsu, H.-P., and Chiang, T.-L. (2019). An improved shuffled frog-leaping algorithm for solving the dynamic and continuous berth allocation problem (DCBAP). Appl. Sci., 9.","DOI":"10.3390\/app9214682"},{"key":"ref_43","doi-asserted-by":"crossref","unstructured":"Mora-Melia, D., Iglesias-Rey, P.L., Mart\u00ednez-Solano, F.J., and Mu\u00f1oz-Velasco, P. (2016). The efficiency of setting parameters in a modified shuffled frog leaping algorithm applied to optimizing water distribution networks. Water, 8.","DOI":"10.3390\/w8050182"},{"key":"ref_44","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/s00170-009-1958-2","article-title":"Application of shuffled frog-leaping algorithm on clustering","volume":"45","author":"Amiri","year":"2009","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"ref_45","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1080\/15732470500254535","article-title":"A modified shuffled frog-leaping optimization algorithm: Applications to project management","volume":"3","author":"Elbeltagi","year":"2007","journal-title":"Struct. Infrastruct. Eng."},{"key":"ref_46","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/s00170-008-1683-2","article-title":"A new parallel genetic algorithm for solving multiobjective scheduling problems subjected to special process constraint","volume":"43","author":"Gao","year":"2009","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"ref_47","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/j.asoc.2016.10.039","article-title":"A realistic variant of bi-objective unrelated parallel machine scheduling problem NSGA-II and MOACO approaches","volume":"50","author":"Afzalirad","year":"2017","journal-title":"Appl. Soft Comput."},{"key":"ref_48","doi-asserted-by":"crossref","first-page":"488","DOI":"10.1016\/j.asoc.2015.12.035","article-title":"A robust hybrid approach based on particle swarm optimization and genetic algorithm to minimize the total machine load on unrelated parallel machines","volume":"41","author":"Mir","year":"2016","journal-title":"Appl. Soft Comput."},{"key":"ref_49","unstructured":"Taguchi, G. (1986). Introduction to Quality Engineering, Asian Productivity Organization."}],"container-title":["Symmetry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2073-8994\/13\/9\/1574\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T06:52:41Z","timestamp":1760165561000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2073-8994\/13\/9\/1574"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,26]]},"references-count":49,"journal-issue":{"issue":"9","published-online":{"date-parts":[[2021,9]]}},"alternative-id":["sym13091574"],"URL":"https:\/\/doi.org\/10.3390\/sym13091574","relation":{},"ISSN":["2073-8994"],"issn-type":[{"value":"2073-8994","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,8,26]]}}}