{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T21:16:39Z","timestamp":1775078199561,"version":"3.50.1"},"reference-count":47,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T00:00:00Z","timestamp":1659312000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T00:00:00Z","timestamp":1659312000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T00:00:00Z","timestamp":1659312000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T00:00:00Z","timestamp":1659312000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T00:00:00Z","timestamp":1659312000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T00:00:00Z","timestamp":1659312000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T00:00:00Z","timestamp":1659312000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61573264"],"award-info":[{"award-number":["61573264"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Applied Soft Computing"],"published-print":{"date-parts":[[2022,8]]},"DOI":"10.1016\/j.asoc.2022.109154","type":"journal-article","created":{"date-parts":[[2022,6,16]],"date-time":"2022-06-16T02:30:08Z","timestamp":1655346608000},"page":"109154","update-policy":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":25,"special_numbering":"C","title":["Scheduling unrelated parallel machines with preventive maintenance and setup time: Multi-sub-colony artificial bee colony"],"prefix":"10.1016","volume":"125","author":[{"given":"Deming","family":"Lei","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hai","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.asoc.2022.109154_b1","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1080\/07408170490247296","article-title":"An industrial extension of the discrete lot-sizing and scheduling problem","volume":"36","author":"Jans","year":"2004","journal-title":"IIE Trans."},{"key":"10.1016\/j.asoc.2022.109154_b2","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1016\/j.cie.2006.01.001","article-title":"Heuristic lot size scheduling on unrelated parallel machines with applications in the textile industry","volume":"50","author":"Silva","year":"2006","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.asoc.2022.109154_b3","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/S0360-8352(01)00004-3","article-title":"Heuristic algorithms for lotsize scheduling with application in the tobacco industry","volume":"39","author":"Pattloch","year":"2001","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.asoc.2022.109154_b4","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/j.omega.2018.07.005","article-title":"Effective heuristic for large-scale unrelated parallel machines scheduling problems","volume":"28","author":"Wang","year":"2019","journal-title":"Omega"},{"key":"10.1016\/j.asoc.2022.109154_b5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ijpe.2017.01.014","article-title":"Parallel-machine scheduling with machine-dependent maintenance periodic recycles","volume":"186","author":"Li","year":"2017","journal-title":"Int. J. Prod. Econ."},{"key":"10.1016\/j.asoc.2022.109154_b6","first-page":"8093","article-title":"Parallel machine scheduling with a deteriorating maintenance activity and total absolute differences penalties","volume":"217","author":"Wang","year":"2011","journal-title":"Appl. Math. Comput."},{"key":"10.1016\/j.asoc.2022.109154_b7","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1016\/j.cie.2016.09.020","article-title":"Parallel machine scheduling with maintenance activities","volume":"101","author":"Yoo","year":"2016","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.asoc.2022.109154_b8","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/j.cor.2016.01.021","article-title":"Scheduling two parallel machines with machine-dependent availabilities","volume":"72","author":"He","year":"2016","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.asoc.2022.109154_b9","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":"2012","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.asoc.2022.109154_b10","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 multi-maintenance activities","volume":"83","author":"Tavana","year":"2015","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.asoc.2022.109154_b11","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":"10.1016\/j.asoc.2022.109154_b12","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":"Gara-Ali","year":"2016","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.asoc.2022.109154_b13","doi-asserted-by":"crossref","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":"10.1016\/j.asoc.2022.109154_b14","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":"10.1016\/j.asoc.2022.109154_b15","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1080\/05695557708975137","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":"AIIE Trans."},{"key":"10.1016\/j.asoc.2022.109154_b16","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."},{"issue":"6","key":"10.1016\/j.asoc.2022.109154_b17","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":"10.1016\/j.asoc.2022.109154_b18","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":"European J. Oper. Res."},{"key":"10.1016\/j.asoc.2022.109154_b19","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":"10.1016\/j.asoc.2022.109154_b20","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":"10.1016\/j.asoc.2022.109154_b21","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":"Neurocomput."},{"issue":"3","key":"10.1016\/j.asoc.2022.109154_b22","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1109\/JAS.2016.7508797","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":"IEE\/CAA J. Autom. Sin."},{"key":"10.1016\/j.asoc.2022.109154_b23","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 Access"},{"key":"10.1016\/j.asoc.2022.109154_b24","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/j.cor.2018.07.007","article-title":"Reformulations and an exact algorithm for unrelated parallel machine scheduling problems with setup times","volume":"101","author":"Fanjul-Peyro","year":"2019","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.asoc.2022.109154_b25","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":"10.1016\/j.asoc.2022.109154_b26","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":"Avalos-Rosales","year":"2018","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.asoc.2022.109154_b27","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 Access"},{"issue":"9","key":"10.1016\/j.asoc.2022.109154_b28","doi-asserted-by":"crossref","first-page":"1574","DOI":"10.3390\/sym13091574","article-title":"A novel shuffled frog-leaping algorithm for unrelated parallel machine scheduling with deteriorating maintenance and setup time","volume":"13","author":"Lei","year":"2021","journal-title":"Symmetry"},{"key":"10.1016\/j.asoc.2022.109154_b29","series-title":"An Idea Based on Honeybee Swarm for Numerical Optimization","author":"Karaboga","year":"2005"},{"key":"10.1016\/j.asoc.2022.109154_b30","doi-asserted-by":"crossref","DOI":"10.1016\/j.swevo.2020.100739","article-title":"Multi-population meta-heuristics for production scheduling: a survey","volume":"58","author":"Lei","year":"2020","journal-title":"Swarm Evol. Comput."},{"issue":"5","key":"10.1016\/j.asoc.2022.109154_b31","first-page":"3279","article-title":"Unrelated parallel machine scheduling with sequence- and machine-dependent setup times and due date constraints","volume":"8","author":"Ying","year":"2012","journal-title":"Int. J. Innov. Comput. Inf. Control"},{"key":"10.1016\/j.asoc.2022.109154_b32","first-page":"1","article-title":"Robust parallel machine scheduling problem with uncertainties and sequence-dependent setup time","author":"Hu","year":"2016","journal-title":"Sci. Prog."},{"key":"10.1016\/j.asoc.2022.109154_b33","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1016\/j.knosys.2016.10.026","article-title":"A multi-objective artificial bee colony algorithm for parallel batch-processing machine scheduling in fabric dyeing processes","volume":"116","author":"Zhang","year":"2017","journal-title":"Knowl.-Based Syst."},{"key":"10.1016\/j.asoc.2022.109154_b34","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":"10.1016\/j.asoc.2022.109154_b35","doi-asserted-by":"crossref","first-page":"5259","DOI":"10.1080\/00207543.2020.1775911","article-title":"An improved artificial bee colony for multi-objective distributed unrelated parallel machine scheduling","volume":"59","author":"Lei","year":"2020","journal-title":"Int. J. Prod. Res."},{"issue":"2019","key":"10.1016\/j.asoc.2022.109154_b36","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1016\/j.ins.2019.02.014","article-title":"An individual dependent multi-colony artificial bee colony algorithm","volume":"485","author":"Zhou","year":"2019","journal-title":"Inform. Sci."},{"key":"10.1016\/j.asoc.2022.109154_b37","doi-asserted-by":"crossref","first-page":"766","DOI":"10.1016\/j.asoc.2015.06.033","article-title":"A dynamic multi-colony artificial bee colony algorithm for multi-objective optimization","volume":"35","author":"Xiang","year":"2015","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.asoc.2022.109154_b38","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":"10.1016\/j.asoc.2022.109154_b39","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":"10.1016\/j.asoc.2022.109154_b40","doi-asserted-by":"crossref","first-page":"1072","DOI":"10.1016\/j.asoc.2017.10.015","article-title":"An improved water flow-like algorithm for order acceptance and scheduling with identical parallel machines","volume":"71","author":"Wu","year":"2018","journal-title":"Appl. Soft Comput."},{"issue":"5\u20138","key":"10.1016\/j.asoc.2022.109154_b41","doi-asserted-by":"crossref","first-page":"1939","DOI":"10.1007\/s00170-018-3043-1","article-title":"Multiobjective approach for deteriorating jobs scheduling for a sustainable manufacturing system","volume":"101","author":"Tigane","year":"2019","journal-title":"Int. J. Adv. Manuf. Technol."},{"issue":"2","key":"10.1016\/j.asoc.2022.109154_b42","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1109\/4235.996017","article-title":"A fast and elitist multiobjective genetic algorithm: NSGA-II","volume":"6","author":"Deb","year":"2002","journal-title":"IEEE Trans. Evol. Comput."},{"key":"10.1016\/j.asoc.2022.109154_b43","series-title":"Processings of 2nd International Conference on Genetic Algorithms","first-page":"224","article-title":"A study of permutation crossover operators on the travelling salesman problem","author":"Oliver","year":"1987"},{"key":"10.1016\/j.asoc.2022.109154_b44","series-title":"Proceedings of 2002 Congress on Evolutionary Computation","first-page":"711","article-title":"On metrics for comparing nondominated sets","author":"Knowles","year":"2002"},{"issue":"4","key":"10.1016\/j.asoc.2022.109154_b45","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1109\/4235.797969","article-title":"Multi-objective evolutionary algorithms: a comparative case study and the strength Pareto approach","volume":"3","author":"Zitzler","year":"1999","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"4","key":"10.1016\/j.asoc.2022.109154_b46","doi-asserted-by":"crossref","first-page":"1065","DOI":"10.1080\/00207543.2014.942011","article-title":"A multi-point simulated annealing heuristic for solving multiple objective unrelated parallel machine scheduling problems","volume":"53","author":"Lin","year":"2015","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/j.asoc.2022.109154_b47","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/j.cor.2017.06.019","article-title":"Solving a bi-objective unrelated parallel batch processing machines scheduling problem: a comparison study","volume":"88","author":"Shahidi-Zadeh","year":"2017","journal-title":"Comput. Oper. Res."}],"container-title":["Applied Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S1568494622004100?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S1568494622004100?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:09:16Z","timestamp":1761595756000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/linkinghub.elsevier.com\/retrieve\/pii\/S1568494622004100"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8]]},"references-count":47,"alternative-id":["S1568494622004100"],"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.asoc.2022.109154","relation":{},"ISSN":["1568-4946"],"issn-type":[{"value":"1568-4946","type":"print"}],"subject":[],"published":{"date-parts":[[2022,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Scheduling unrelated parallel machines with preventive maintenance and setup time: Multi-sub-colony artificial bee colony","name":"articletitle","label":"Article Title"},{"value":"Applied Soft Computing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.asoc.2022.109154","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2022 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}],"article-number":"109154"}}