{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,14]],"date-time":"2026-07-14T13:08:39Z","timestamp":1784034519437,"version":"3.55.0"},"reference-count":89,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["72271070"],"award-info":[{"award-number":["72271070"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003995","name":"Natural Science Foundation of Anhui Province","doi-asserted-by":"publisher","award":["2208085J07"],"award-info":[{"award-number":["2208085J07"]}],"id":[{"id":"10.13039\/501100003995","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["2024YFB3311103"],"award-info":[{"award-number":["2024YFB3311103"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[2026,8]]},"DOI":"10.1016\/j.cor.2026.107492","type":"journal-article","created":{"date-parts":[[2026,3,29]],"date-time":"2026-03-29T23:25:44Z","timestamp":1774826744000},"page":"107492","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":2,"special_numbering":"C","title":["A modified adaptive large neighborhood search algorithm for solving network-shared manufacturing resource scheduling"],"prefix":"10.1016","volume":"192","author":[{"given":"Kai","family":"Li","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-3173-1183","authenticated-orcid":false,"given":"Zhicheng","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fulong","family":"Xie","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Liping","family":"Xu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jianfu","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.cor.2026.107492_b1","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1016\/j.cie.2016.07.028","article-title":"Multi-objective optimisation of dynamic scheduling in robotic flexible assembly cells via fuzzy-based Taguchi approach","volume":"99","author":"Abd","year":"2016","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.cor.2026.107492_b2","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1016\/j.jclepro.2018.10.048","article-title":"Energy cost minimization for unrelated parallel machine scheduling under real time and demand charge pricing","volume":"208","author":"Abikarram","year":"2019","journal-title":"J. Clean. Prod."},{"issue":"9","key":"10.1016\/j.cor.2026.107492_b3","doi-asserted-by":"crossref","first-page":"1025","DOI":"10.3390\/pr8091025","article-title":"Scheduling two identical parallel machines subjected to release times, delivery times and unavailability constraints","volume":"8","author":"Al-Shayea","year":"2020","journal-title":"Processes"},{"issue":"2","key":"10.1016\/j.cor.2026.107492_b4","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":"European J. Oper. Res."},{"key":"10.1016\/j.cor.2026.107492_b5","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.cor.2026.107492_b6","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.cor.2026.107492_b7","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1016\/j.cie.2016.12.019","article-title":"A genetic algorithm-Taguchi based approach to inventory routing problem of a single perishable product with transshipment","volume":"104","author":"Azadeh","year":"2017","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.cor.2026.107492_b8","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/j.cie.2019.03.051","article-title":"A hybrid metaheuristic algorithm for a parallel machine scheduling problem with dependent setup times","volume":"131","author":"B\u00e1ez","year":"2019","journal-title":"Comput. Ind. Eng."},{"issue":"3","key":"10.1016\/j.cor.2026.107492_b9","doi-asserted-by":"crossref","first-page":"834","DOI":"10.1016\/j.ejor.2016.08.008","article-title":"Scheduling identical parallel machines with tooling constraints","volume":"257","author":"Beez\u00e3o","year":"2017","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.cor.2026.107492_b10","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2022.108736","article-title":"Unrelated parallel machines scheduling with dependent setup times in textile industry","volume":"174","author":"Berthier","year":"2022","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.cor.2026.107492_b11","first-page":"1","article-title":"A note on scheduling identical parallel machines with preemptions and setup times","author":"Boudhar","year":"2024","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/j.cor.2026.107492_b12","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/s10951-014-0400-2","article-title":"Scheduling multi-colour print jobs with sequence-dependent setup times","volume":"18","author":"Burger","year":"2015","journal-title":"J. Sched."},{"issue":"1","key":"10.1016\/j.cor.2026.107492_b13","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1016\/j.ejor.2021.05.005","article-title":"An iterated local search procedure for the job sequencing and tool switching problem with non-identical parallel machines","volume":"297","author":"Calmels","year":"2022","journal-title":"European J. Oper. Res."},{"issue":"8","key":"10.1016\/j.cor.2026.107492_b14","doi-asserted-by":"crossref","first-page":"1995","DOI":"10.1016\/j.cor.2004.01.001","article-title":"Parallel machine selection and job scheduling to minimize machine cost and job tardiness","volume":"32","author":"Cao","year":"2005","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"10.1016\/j.cor.2026.107492_b15","doi-asserted-by":"crossref","first-page":"856","DOI":"10.1016\/j.ejor.2024.03.011","article-title":"A branch-and-price algorithm for unrelated parallel machine scheduling with machine usage costs","volume":"316","author":"Chen","year":"2024","journal-title":"European J. Oper. Res."},{"issue":"2","key":"10.1016\/j.cor.2026.107492_b16","first-page":"21","article-title":"A simplified swarm optimization algorithm to minimize makespan on non-identical parallel machines with unequal job release times under non-renewable resource constraints","volume":"24","author":"Chen","year":"2024","journal-title":"Oper. Res."},{"key":"10.1016\/j.cor.2026.107492_b17","series-title":"2017 IEEE Congress on Evolutionary Computation","first-page":"185","article-title":"An adaptive large neighborhood search with learning automata for the unrelated parallel machine scheduling problem","author":"Cota","year":"2017"},{"key":"10.1016\/j.cor.2026.107492_b18","doi-asserted-by":"crossref","DOI":"10.1016\/j.swevo.2019.100601","article-title":"An adaptive multi-objective algorithm based on decomposition and large neighborhood search for a green machine scheduling problem","volume":"51","author":"Cota","year":"2019","journal-title":"Swarm Evol. Comput."},{"issue":"2","key":"10.1016\/j.cor.2026.107492_b19","doi-asserted-by":"crossref","first-page":"640","DOI":"10.1016\/j.ejor.2020.09.050","article-title":"A matheuristic for parallel machine scheduling with tool replacements","volume":"291","author":"Dang","year":"2021","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.cor.2026.107492_b20","article-title":"A differential evolution algorithm for the customer order scheduling problem with sequence-dependent setup times","volume":"189","author":"de Athayde Prata","year":"2022","journal-title":"Expert Syst. Appl."},{"issue":"2","key":"10.1016\/j.cor.2026.107492_b21","doi-asserted-by":"crossref","first-page":"1138","DOI":"10.1109\/TASE.2015.2495328","article-title":"Parallel machine scheduling under time-of-use electricity prices: New models and optimization approaches","volume":"13","author":"Ding","year":"2015","journal-title":"IEEE Trans. Autom. Sci. Eng."},{"issue":"5","key":"10.1016\/j.cor.2026.107492_b22","doi-asserted-by":"crossref","first-page":"1035","DOI":"10.1137\/S009753970343395X","article-title":"Better online algorithms for scheduling with machine cost","volume":"33","author":"D\u00f3sa","year":"2004","journal-title":"SIAM J. Comput."},{"issue":"3","key":"10.1016\/j.cor.2026.107492_b23","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/j.disopt.2010.02.005","article-title":"New upper and lower bounds for online scheduling with machine cost","volume":"7","author":"D\u00f3sa","year":"2010","journal-title":"Discrete Optim."},{"issue":"9","key":"10.1016\/j.cor.2026.107492_b24","doi-asserted-by":"crossref","first-page":"2479","DOI":"10.1016\/j.cor.2004.03.013","article-title":"Heuristic methods for the identical parallel machine flowtime problem with set-up times","volume":"32","author":"Dunstall","year":"2005","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2026.107492_b25","doi-asserted-by":"crossref","DOI":"10.1016\/j.knosys.2022.108193","article-title":"Hybrid meta-heuristics for the unrelated parallel machine scheduling problem with setup times","volume":"241","author":"Fang","year":"2022","journal-title":"Knowl.-Based Syst."},{"key":"10.1016\/j.cor.2026.107492_b26","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2023.106504","article-title":"A fix-and-optimize heuristic for the Unrelated Parallel Machine Scheduling Problem","volume":"163","author":"Fonseca","year":"2024","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2026.107492_b27","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":"10.1016\/j.cor.2026.107492_b28","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/j.cie.2017.02.013","article-title":"Modeling and solving static m identical parallel machines scheduling problem with a common server and sequence dependent setup times","volume":"106","author":"Hamzadayi","year":"2017","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.cor.2026.107492_b29","doi-asserted-by":"crossref","DOI":"10.1016\/j.ress.2022.108429","article-title":"Joint decision-making of parallel machine scheduling restricted in job-machine release time and preventive maintenance with remaining useful life constraints","volume":"222","author":"He","year":"2022","journal-title":"Reliab. Eng. Syst. Saf."},{"key":"10.1016\/j.cor.2026.107492_b30","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2023.106474","article-title":"Unrelated parallel batch processing machine scheduling with time requirements and two-dimensional packing constraints","volume":"162","author":"Hu","year":"2024","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2026.107492_b31","series-title":"International Workshop on Randomization and Approximation Techniques in Computer Science","first-page":"168","article-title":"Scheduling with machine cost","author":"Imreh","year":"1999"},{"issue":"12","key":"10.1016\/j.cor.2026.107492_b32","doi-asserted-by":"crossref","first-page":"247","DOI":"10.3390\/a12120247","article-title":"Modeling and solving scheduling problem with m uniform parallel machines subject to unavailability constraints","volume":"12","author":"Kaabi","year":"2019","journal-title":"Algorithms"},{"issue":"6","key":"10.1016\/j.cor.2026.107492_b33","doi-asserted-by":"crossref","first-page":"911","DOI":"10.1016\/j.engappai.2010.01.031","article-title":"An effective hybrid multi-objective genetic algorithm for bi-criteria scheduling on a single batch processing machine with non-identical job sizes","volume":"23","author":"Kashan","year":"2010","journal-title":"Eng. Appl. Artif. Intell."},{"issue":"6","key":"10.1016\/j.cor.2026.107492_b34","doi-asserted-by":"crossref","first-page":"1628","DOI":"10.1080\/00207543.2019.1672900","article-title":"Minimising total tardiness for the identical parallel machine scheduling problem with splitting jobs and sequence-dependent setup times","volume":"58","author":"Kim","year":"2020","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/j.cor.2026.107492_b35","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/s10472-018-9602-1","article-title":"A BRKGA-DE algorithm for parallel-batching scheduling with deterioration and learning effects on parallel machines under preventive maintenance consideration","volume":"88","author":"Kong","year":"2020","journal-title":"Ann. Math. Artif. Intell."},{"issue":"3","key":"10.1016\/j.cor.2026.107492_b36","doi-asserted-by":"crossref","first-page":"825","DOI":"10.1016\/j.ejor.2019.07.006","article-title":"Mathematical formulations for scheduling jobs on identical parallel machines with family setup times and total weighted completion time minimization","volume":"289","author":"Kramer","year":"2021","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.cor.2026.107492_b37","doi-asserted-by":"crossref","first-page":"992","DOI":"10.1007\/s10696-020-09400-9","article-title":"A heuristic algorithm for identical parallel machine scheduling: splitting jobs, sequence-dependent setup times, and limited setup operators","volume":"33","author":"Lee","year":"2021","journal-title":"Flex. Serv. Manuf. J."},{"key":"10.1016\/j.cor.2026.107492_b38","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1016\/j.ijpe.2014.02.013","article-title":"Scheduling with multi-attribute setup times on two identical parallel machines","volume":"153","author":"Lee","year":"2014","journal-title":"Int. J. Prod. Econ."},{"key":"10.1016\/j.cor.2026.107492_b39","doi-asserted-by":"crossref","first-page":"2081","DOI":"10.1007\/s00170-013-5192-6","article-title":"A tabu search algorithm for unrelated parallel machine scheduling with sequence-and machine-dependent setups: minimizing total tardiness","volume":"69","author":"Lee","year":"2013","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"10.1016\/j.cor.2026.107492_b40","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2022.117577","article-title":"An adaptive artificial bee colony for unrelated parallel machine scheduling with additional resource and maintenance","volume":"205","author":"Lei","year":"2022","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.cor.2026.107492_b41","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.cor.2026.107492_b42","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2022.109154","article-title":"Scheduling unrelated parallel machines with preventive maintenance and setup time: Multi-sub-colony artificial bee colony","volume":"125","author":"Lei","year":"2022","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.cor.2026.107492_b43","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/j.eswa.2019.01.002","article-title":"Minimizing total tardiness on two uniform parallel machines considering a cost constraint","volume":"123","author":"Li","year":"2019","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.cor.2026.107492_b44","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/s11590-016-1096-3","article-title":"Uniform parallel machine scheduling problems with fixed machine cost","volume":"12","author":"Li","year":"2018","journal-title":"Optim. Lett."},{"key":"10.1016\/j.cor.2026.107492_b45","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1016\/j.jmsy.2015.11.006","article-title":"Parallel machine scheduling problems in green manufacturing industry","volume":"38","author":"Li","year":"2016","journal-title":"J. Manuf. Syst."},{"issue":"2","key":"10.1016\/j.cor.2026.107492_b46","doi-asserted-by":"crossref","first-page":"458","DOI":"10.1016\/j.ejor.2006.11.027","article-title":"Parallel machine scheduling with machine availability and eligibility constraints","volume":"184","author":"Liao","year":"2008","journal-title":"European J. Oper. Res."},{"issue":"4","key":"10.1016\/j.cor.2026.107492_b47","doi-asserted-by":"crossref","first-page":"1200","DOI":"10.1080\/00207543.2013.848305","article-title":"Unrelated parallel machine scheduling with setup times and ready times","volume":"52","author":"Lin","year":"2014","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/j.cor.2026.107492_b48","doi-asserted-by":"crossref","DOI":"10.1016\/j.omega.2022.102804","article-title":"Online scheduling on parallel-batch machines with periodic availability constraints and job delivery","volume":"116","author":"Lin","year":"2023","journal-title":"Omega"},{"issue":"17","key":"10.1016\/j.cor.2026.107492_b49","doi-asserted-by":"crossref","first-page":"6013","DOI":"10.1080\/00207543.2022.2121869","article-title":"GRASP algorithms for the unrelated parallel machines scheduling problem with additional resources during processing and setups","volume":"61","author":"Lopez-Esteve","year":"2023","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/j.cor.2026.107492_b50","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2019.104812","article-title":"An improved particle swarm optimization algorithm to solve hybrid flowshop scheduling problems with the effect of human factors\u2013A case study","volume":"114","author":"Marichelvam","year":"2020","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"10.1016\/j.cor.2026.107492_b51","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1016\/j.ejor.2021.08.005","article-title":"Iterated greedy algorithms for a complex parallel machine scheduling problem","volume":"300","author":"Mecler","year":"2022","journal-title":"European J. Oper. Res."},{"issue":"22","key":"10.1016\/j.cor.2026.107492_b52","doi-asserted-by":"crossref","first-page":"6845","DOI":"10.1016\/j.apm.2015.02.027","article-title":"A vibration damping optimization algorithm for a parallel machines scheduling problem with sequence-independent family setup times","volume":"39","author":"Mehdizadeh","year":"2015","journal-title":"Appl. Math. Model."},{"key":"10.1016\/j.cor.2026.107492_b53","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2023.106351","article-title":"An adaptive Large Neighbourhood Search algorithm for a real-world Home Care Scheduling Problem with time windows and dynamic breaks","volume":"159","author":"M\u00e9ndez-Fern\u00e1ndez","year":"2023","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2026.107492_b54","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":"10.1016\/j.cor.2026.107492_b55","doi-asserted-by":"crossref","first-page":"1579","DOI":"10.1007\/s00170-013-5348-4","article-title":"A scheduling model for serial jobs on parallel machines with different preventive maintenance (PM)","volume":"70","author":"Mirabedini","year":"2014","journal-title":"Int. J. Adv. Manuf. Technol."},{"issue":"10","key":"10.1016\/j.cor.2026.107492_b56","doi-asserted-by":"crossref","first-page":"5470","DOI":"10.3390\/su13105470","article-title":"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","volume":"13","author":"Nanthapodej","year":"2021","journal-title":"Sustainability"},{"issue":"4","key":"10.1016\/j.cor.2026.107492_b57","doi-asserted-by":"crossref","first-page":"764","DOI":"10.1016\/j.cie.2007.08.011","article-title":"Scheduling jobs on parallel machines with setup times and ready times","volume":"54","author":"Pfund","year":"2008","journal-title":"Comput. Ind. Eng."},{"issue":"8","key":"10.1016\/j.cor.2026.107492_b58","doi-asserted-by":"crossref","first-page":"2403","DOI":"10.1016\/j.cor.2005.09.012","article-title":"A general heuristic for vehicle routing problems","volume":"34","author":"Pisinger","year":"2007","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2026.107492_b59","article-title":"An improved ALNS for hybrid pickup and drones delivery system in disaster by penalizing deprivation time","volume":"170","author":"Rahimi","year":"2024","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2026.107492_b60","doi-asserted-by":"crossref","DOI":"10.7717\/peerj-cs.844","article-title":"A mathematical formulation and an NSGA-II algorithm for minimizing the makespan and energy cost under time-of-use electricity price in an unrelated parallel machine scheduling","volume":"8","author":"Rego","year":"2022","journal-title":"PeerJ Comput. Sci."},{"key":"10.1016\/j.cor.2026.107492_b61","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2023.106159","article-title":"Formulations and an adaptive large neighborhood search for just-in-time scheduling of unrelated parallel machines with a common due window","volume":"153","author":"Rolim","year":"2023","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2026.107492_b62","doi-asserted-by":"crossref","DOI":"10.1016\/j.jclepro.2019.119393","article-title":"Energy-efficient scheduling in an unrelated parallel-machine environment under time-of-use electricity tariffs","volume":"249","author":"Saberi-Aliabad","year":"2020","journal-title":"J. Clean. Prod."},{"issue":"1","key":"10.1016\/j.cor.2026.107492_b63","first-page":"33","article-title":"Unrelated parallel machine scheduling with machine processing cost","volume":"14","author":"Safarzadeh","year":"2023","journal-title":"Int. J. Ind. Eng. Comput."},{"key":"10.1016\/j.cor.2026.107492_b64","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2023.109219","article-title":"Unrelated parallel machine scheduling models with machine availability and eligibility constraints","volume":"179","author":"Santoro","year":"2023","journal-title":"Comput. Ind. Eng."},{"issue":"2","key":"10.1016\/j.cor.2026.107492_b65","doi-asserted-by":"crossref","first-page":"444","DOI":"10.1080\/01605682.2019.1671153","article-title":"Exact and metaheuristic approaches for identical parallel machine scheduling with a common server and sequence-dependent setup times","volume":"72","author":"Silva","year":"2021","journal-title":"J. Oper. Res. Soc."},{"key":"10.1016\/j.cor.2026.107492_b66","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/j.cie.2016.09.018","article-title":"Lagrangian approach to minimize makespan of non-identical parallel batch processing machines","volume":"101","author":"Suhaimi","year":"2016","journal-title":"Comput. Ind. Eng."},{"issue":"1\u20132","key":"10.1016\/j.cor.2026.107492_b67","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/j.ijpe.2004.12.007","article-title":"A linear programming approach for identical parallel machine scheduling with job splitting and sequence-dependent setup times","volume":"99","author":"Tahar","year":"2006","journal-title":"Int. J. Prod. Econ."},{"key":"10.1016\/j.cor.2026.107492_b68","series-title":"Makespan Minimization for Job Co-Scheduling on Chip Multiprocessors","author":"Tian","year":"2010"},{"issue":"3","key":"10.1016\/j.cor.2026.107492_b69","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":"European J. Oper. Res."},{"issue":"4","key":"10.1016\/j.cor.2026.107492_b70","doi-asserted-by":"crossref","first-page":"1955","DOI":"10.1109\/TASE.2018.2832440","article-title":"Unrelated parallel machine selection and job scheduling with the objective of minimizing total workload and machine fixed costs","volume":"15","author":"Wang","year":"2018","journal-title":"IEEE Trans. Autom. Sci. Eng."},{"key":"10.1016\/j.cor.2026.107492_b71","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."},{"issue":"2","key":"10.1016\/j.cor.2026.107492_b72","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1109\/JSEE.2012.00027","article-title":"Self-adaptive large neighborhood search algorithm for parallel machine scheduling problems","volume":"23","author":"Wang","year":"2012","journal-title":"J. Syst. Eng. Electron."},{"key":"10.1016\/j.cor.2026.107492_b73","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/j.jmsy.2021.02.008","article-title":"Digital twin-driven service model and optimal allocation of manufacturing resources in shared manufacturing","volume":"59","author":"Wang","year":"2021","journal-title":"J. Manuf. Syst."},{"key":"10.1016\/j.cor.2026.107492_b74","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2019.104779","article-title":"Dynamic dispatching and preventive maintenance for parallel machines with dispatching-dependent deterioration","volume":"113","author":"Wu","year":"2020","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"10.1016\/j.cor.2026.107492_b75","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ijpe.2012.01.026","article-title":"Scheduling jobs on identical parallel machines with unequal future ready time and sequence dependent setup: An experimental study","volume":"137","author":"Xi","year":"2012","journal-title":"Int. J. Prod. Econ."},{"issue":"2","key":"10.1016\/j.cor.2026.107492_b76","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1007\/s10696-023-09488-9","article-title":"A tabu-based adaptive large neighborhood search for scheduling unrelated parallel batch processing machines with non-identical job sizes and dynamic job arrivals","volume":"36","author":"Xiao","year":"2024","journal-title":"Flex. Serv. Manuf. J."},{"key":"10.1016\/j.cor.2026.107492_b77","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2025.106976","article-title":"An adaptive large neighborhood search for unrelated parallel machine scheduling with setup times and delivery times","volume":"177","author":"Xie","year":"2025","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2026.107492_b78","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2025.107076","article-title":"Q-learning-driven multi-population cooperative evolutionary algorithm with local search for scheduling of network-shared manufacturing resources","author":"Xu","year":"2025","journal-title":"Comput. Oper. Res."},{"issue":"8","key":"10.1016\/j.cor.2026.107492_b79","doi-asserted-by":"crossref","first-page":"2131","DOI":"10.1016\/j.apm.2014.10.012","article-title":"Uniform parallel machine scheduling with resource consumption constraint","volume":"39","author":"Yeh","year":"2015","journal-title":"Appl. Math. Model."},{"key":"10.1016\/j.cor.2026.107492_b80","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2019.112959","article-title":"GRASP algorithm for the unrelated parallel machine scheduling problem with setup times and additional resources","volume":"141","author":"Yepes-Borrero","year":"2020","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.cor.2026.107492_b81","doi-asserted-by":"crossref","first-page":"1795","DOI":"10.1007\/s10845-010-0483-3","article-title":"Makespan minimization for scheduling unrelated parallel machines with setup times","volume":"23","author":"Ying","year":"2012","journal-title":"J. Intell. Manuf."},{"key":"10.1016\/j.cor.2026.107492_b82","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2020.106602","article-title":"Shared manufacturing in the sharing economy: Concept, definition and service operations","volume":"146","author":"Yu","year":"2020","journal-title":"Comput. Ind. Eng."},{"issue":"7","key":"10.1016\/j.cor.2026.107492_b83","doi-asserted-by":"crossref","first-page":"2212","DOI":"10.1080\/00207543.2021.1885068","article-title":"Constraint programming approach for multi-resource-constrained unrelated parallel machine scheduling problem with sequence-dependent setup times","volume":"60","author":"Yunusoglu","year":"2022","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/j.cor.2026.107492_b84","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."},{"issue":"1","key":"10.1016\/j.cor.2026.107492_b85","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1080\/0305215X.2017.1296437","article-title":"Bi-objective scheduling on uniform parallel machines considering electricity cost","volume":"50","author":"Zeng","year":"2018","journal-title":"Eng. Optim."},{"key":"10.1016\/j.cor.2026.107492_b86","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2022.105738","article-title":"A general variable neighborhood search algorithm for a parallel-machine scheduling problem considering machine health conditions and preventive maintenance","volume":"143","author":"Zhang","year":"2022","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2026.107492_b87","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2021.114843","article-title":"A combinatorial evolutionary algorithm for unrelated parallel machine scheduling problem with sequence and machine-dependent setup times, limited worker resources and learning effect","volume":"175","author":"Zhang","year":"2021","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.cor.2026.107492_b88","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2020.106482","article-title":"Parallel-machine scheduling with linear deteriorating jobs and preventive maintenance activities under a potential machine disruption","volume":"145","author":"Zhang","year":"2020","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.cor.2026.107492_b89","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2022.108483","article-title":"Unrelated parallel machine scheduling with processing cost, machine eligibility and order splitting","volume":"171","author":"Zheng","year":"2022","journal-title":"Comput. Ind. Eng."}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054826001103?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054826001103?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,4,20]],"date-time":"2026-04-20T11:21:21Z","timestamp":1776684081000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054826001103"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8]]},"references-count":89,"alternative-id":["S0305054826001103"],"URL":"https:\/\/doi.org\/10.1016\/j.cor.2026.107492","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2026,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A modified adaptive large neighborhood search algorithm for solving network-shared manufacturing resource scheduling","name":"articletitle","label":"Article Title"},{"value":"Computers & Operations Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.cor.2026.107492","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier Ltd. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"107492"}}