{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,20]],"date-time":"2024-09-20T16:55:27Z","timestamp":1726851327474},"reference-count":54,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2022,10,1]],"date-time":"2022-10-01T00:00:00Z","timestamp":1664582400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2022,10,1]],"date-time":"2022-10-01T00:00:00Z","timestamp":1664582400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2022,10,1]],"date-time":"2022-10-01T00:00:00Z","timestamp":1664582400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2022,10,1]],"date-time":"2022-10-01T00:00:00Z","timestamp":1664582400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2022,10,1]],"date-time":"2022-10-01T00:00:00Z","timestamp":1664582400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,10,1]],"date-time":"2022-10-01T00:00:00Z","timestamp":1664582400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100012247","name":"Program of Shanghai Academic Research Leader","doi-asserted-by":"publisher","award":["21XD1401000"],"id":[{"id":"10.13039\/501100012247","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100017350","name":"Shanghai Key Laboratory of Power Station Automation Technology","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100017350","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61973203"],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Swarm and Evolutionary Computation"],"published-print":{"date-parts":[[2022,10]]},"DOI":"10.1016\/j.swevo.2022.101143","type":"journal-article","created":{"date-parts":[[2022,7,20]],"date-time":"2022-07-20T21:37:39Z","timestamp":1658353059000},"page":"101143","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":33,"special_numbering":"C","title":["An effective two-stage iterated greedy algorithm to minimize total tardiness for the distributed flowshop group scheduling problem"],"prefix":"10.1016","volume":"74","author":[{"given":"Zhi-Yuan","family":"Wang","sequence":"first","affiliation":[]},{"given":"Quan-Ke","family":"Pan","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-1485-0722","authenticated-orcid":false,"given":"Liang","family":"Gao","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-6508-0051","authenticated-orcid":false,"given":"Yu-Long","family":"Wang","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.swevo.2022.101143_bib0001","doi-asserted-by":"crossref","first-page":"858","DOI":"10.1016\/j.ejor.2019.10.017","article-title":"Generalised accelerations for insertion-based heuristics in permutation flowshop scheduling","volume":"282","author":"Fernandez-Viagas","year":"2020","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.swevo.2022.101143_bib0002","series-title":"Recent trends in distributed production network scheduling problem","author":"Bagheri Rad","year":"2021"},{"key":"10.1016\/j.swevo.2022.101143_bib0003","first-page":"947","article-title":"A Cooperative Memetic Algorithm with Learning-Based Agent for Energy-Aware Distributed Hybrid Flow-Shop Scheduling","volume":"5","author":"jing Wang","year":"2021","journal-title":"IEEE Trans. Evol. Comput."},{"key":"10.1016\/j.swevo.2022.101143_bib0004","doi-asserted-by":"crossref","DOI":"10.1016\/j.swevo.2020.100804","article-title":"A distributed heterogeneous permutation flowshop scheduling problem with lot-streaming and carryover sequence-dependent setup time","volume":"60","author":"Meng","year":"2021","journal-title":"Swarm Evol. Comput."},{"key":"10.1016\/j.swevo.2022.101143_bib0005","doi-asserted-by":"crossref","first-page":"754","DOI":"10.1016\/j.cor.2009.06.019","article-title":"The distributed permutation flowshop scheduling problem","volume":"37","author":"Naderi","year":"2010","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.swevo.2022.101143_bib0006","doi-asserted-by":"crossref","first-page":"695","DOI":"10.1007\/s00170-009-2112-x","article-title":"Constrained scheduling of the inspection activities on semiconductor wafers grouped in families with sequence-dependent set-up times","volume":"46","author":"Celano","year":"2010","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"10.1016\/j.swevo.2022.101143_bib0007","doi-asserted-by":"crossref","first-page":"1791","DOI":"10.1080\/00207543.2014.961209","article-title":"Minimising makespan in flowshop group scheduling with sequence-dependent family set-up times using inserted idle times","volume":"53","author":"Neufeld","year":"2015","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/j.swevo.2022.101143_bib0008","doi-asserted-by":"crossref","first-page":"1350","DOI":"10.1016\/j.cor.2006.08.016","article-title":"Minimising total tardiness in the m-machine flowshop problem: a review and evaluation of heuristics and metaheuristics","volume":"35","author":"Vallada","year":"2008","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.swevo.2022.101143_bib0009","doi-asserted-by":"crossref","DOI":"10.1016\/j.swevo.2020.100742","article-title":"An effective iterated greedy method for the distributed permutation flowshop scheduling problem with sequence-dependent setup times","volume":"59","author":"Huang","year":"2020","journal-title":"Swarm Evol. Comput."},{"key":"10.1016\/j.swevo.2022.101143_bib0010","doi-asserted-by":"crossref","first-page":"1269","DOI":"10.1080\/0305215X.2013.827673","article-title":"An effective hybrid immune algorithm for solving the distributed permutation flow-shop scheduling problem","volume":"46","author":"Xu","year":"2014","journal-title":"Eng. Optim."},{"key":"10.1016\/j.swevo.2022.101143_bib0011","doi-asserted-by":"crossref","first-page":"641","DOI":"10.1080\/00207543.2011.644819","article-title":"An efficient tabu search algorithm for the distributed permutation flowshop scheduling problem","volume":"51","author":"Gao","year":"2013","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/j.swevo.2022.101143_bib0012","doi-asserted-by":"crossref","first-page":"5029","DOI":"10.1080\/00207543.2013.790571","article-title":"Minimising makespan in distributed permutation flowshops using a modified iterated greedy algorithm","volume":"51","author":"Lin","year":"2013","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/j.swevo.2022.101143_bib0013","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/j.ejor.2014.05.024","article-title":"A scatter search algorithm for the distributed permutation flowshop scheduling problem","volume":"239","author":"Naderi","year":"2014","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.swevo.2022.101143_bib0014","doi-asserted-by":"crossref","first-page":"1111","DOI":"10.1080\/00207543.2014.948578","article-title":"A bounded-search iterated greedy algorithm for the distributed permutation flowshop scheduling problem","volume":"53","author":"Fernandez-Viagas","year":"2015","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/j.swevo.2022.101143_bib0015","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1016\/j.ijpe.2013.05.004","article-title":"An effective estimation of distribution algorithm for solving the distributed permutation flow-shop scheduling problem","volume":"145","author":"Wang","year":"2013","journal-title":"Int. J. Prod. Econ."},{"key":"10.1016\/j.swevo.2022.101143_bib0016","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/j.cie.2017.07.020","article-title":"A novel chemical reaction optimization for the distributed permutation flowshop scheduling problem with makespan criterion","volume":"111","author":"Bargaoui","year":"2017","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.swevo.2022.101143_bib0017","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0305-0483(83)90088-9","article-title":"A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem","volume":"11","author":"Nawaz","year":"1983","journal-title":"Omega"},{"key":"10.1016\/j.swevo.2022.101143_bib0018","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2020.105006","article-title":"An effective benders decomposition algorithm for solving the distributed permutation flowshop scheduling problem","volume":"123","author":"Hamzaday\u0131","year":"2020","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.swevo.2022.101143_bib0019","first-page":"213","article-title":"Iterated Greedy methods for the distributed permutation flowshop scheduling problem","volume":"83","author":"Ruiz","year":"2019","journal-title":"Omega (United Kingdom)"},{"key":"10.1016\/j.swevo.2022.101143_bib0020","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1016\/j.cie.2018.03.014","article-title":"The distributed permutation flow shop to minimise the total flowtime","volume":"118","author":"Fernandez-Viagas","year":"2018","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.swevo.2022.101143_bib0021","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/j.eswa.2019.01.062","article-title":"Effective heuristics and metaheuristics to minimize total flowtime for the distributed permutation flowshop problem","volume":"124","author":"Pan","year":"2019","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.swevo.2022.101143_bib0022","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2020.106629","article-title":"An effective Iterated Greedy algorithm for the distributed permutation flowshop scheduling with due windows","volume":"96","author":"Jing","year":"2020","journal-title":"Appl. Soft Comput. J."},{"key":"10.1016\/j.swevo.2022.101143_bib0023","article-title":"Effective heuristics and metaheuristics to minimise total tardiness for the distributed permutation flowshop scheduling problem","author":"Khare","year":"2020","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/j.swevo.2022.101143_bib0024","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1016\/j.cie.2016.06.012","article-title":"A hybrid iterated greedy algorithm for total tardiness minimization in permutation flowshops","volume":"98","author":"Karabulut","year":"2016","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.swevo.2022.101143_bib0025","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/j.swevo.2016.06.002","article-title":"A competitive memetic algorithm for multi-objective distributed permutation flow shop scheduling problem","volume":"32","author":"Deng","year":"2017","journal-title":"Swarm Evol. Comput."},{"key":"10.1016\/j.swevo.2022.101143_bib0026","first-page":"97","article-title":"Effective constructive heuristics and discrete bee colony optimization for distributed flowshop with setup times","author":"Huang","year":"2021","journal-title":"Eng. Appl. Artif. Intell."},{"key":"10.1016\/j.swevo.2022.101143_bib0027","first-page":"59","article-title":"Effective heuristics and metaheuristics for the distributed fuzzy blocking flow-shop scheduling problem","author":"Shao","year":"2020","journal-title":"Swarm Evol. Comput."},{"key":"10.1016\/j.swevo.2022.101143_bib0028","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2020.113678","article-title":"An ensemble discrete differential evolution for the distributed blocking flowshop scheduling with minimizing makespan criterion","volume":"160","author":"Zhao","year":"2020","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.swevo.2022.101143_bib0029","doi-asserted-by":"crossref","first-page":"1344","DOI":"10.1109\/TASE.2018.2886303","article-title":"A Pareto-Based Estimation of Distribution Algorithm for Solving Multiobjective Distributed No-Wait Flow-Shop Scheduling Problem With Sequence-Dependent Setup Time","volume":"16","author":"Shao","year":"2019","journal-title":"IEEE Trans. Autom. Sci. Eng."},{"key":"10.1016\/j.swevo.2022.101143_bib0030","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2021.107337","article-title":"Heuristics and iterated greedy algorithms for the distributed mixed no-idle flowshop with sequence-dependent setup times","volume":"157","author":"Rossi","year":"2021","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.swevo.2022.101143_bib0031","article-title":"An effective multi-start iterated greedy algorithm to minimize makespan for the distributed permutation flowshop scheduling problem with preventive maintenance","volume":"169","author":"yang Mao","year":"2021","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.swevo.2022.101143_bib0032","doi-asserted-by":"crossref","first-page":"108413","DOI":"10.1016\/j.knosys.2022.108413","article-title":"A hash map-based memetic algorithm for the distributed permutation flowshop scheduling problem with preventive maintenance to minimize total flowtime","volume":"242","author":"Mao","year":"2022","journal-title":"Knowl. Based Syst."},{"key":"10.1016\/j.swevo.2022.101143_bib0033","doi-asserted-by":"crossref","first-page":"759","DOI":"10.1016\/j.scient.2011.05.023","article-title":"A fast hybrid particle swarm optimization algorithm for flow shop sequence dependent group scheduling problem","volume":"18","author":"Hajinejad","year":"2011","journal-title":"Sci. Iran."},{"key":"10.1016\/j.swevo.2022.101143_bib0034","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1016\/j.ijpe.2015.10.002","article-title":"A hybrid algorithm for the multi-stage flow shop group scheduling with sequence-dependent setup and transportation times","volume":"170","author":"Liou","year":"2015","journal-title":"Int. J. Prod. Econ."},{"key":"10.1016\/j.swevo.2022.101143_bib0035","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1504\/EJIE.2019.097920","article-title":"Flowshop sequence-dependent group scheduling with minimisation of weighted earliness and tardiness","volume":"13","author":"Keshavarz","year":"2019","journal-title":"Eur. J. Ind. Eng."},{"key":"10.1016\/j.swevo.2022.101143_bib0036","article-title":"An Effective Cooperative Co-Evolutionary Algorithm for Distributed Flowshop Group Scheduling Problems","author":"Pan","year":"2021","journal-title":"IEEE Trans. Cybern."},{"key":"10.1016\/j.swevo.2022.101143_bib0037","article-title":"A Greedy Cooperative Co-evolution ary Algorithm with Problem-specific Knowledge for Multi-objective Flowshop Group Scheduling Problems","author":"He","year":"2021","journal-title":"IEEE Trans. Evol. Comput."},{"key":"10.1016\/j.swevo.2022.101143_bib0038","doi-asserted-by":"crossref","first-page":"2033","DOI":"10.1016\/j.ejor.2005.12.009","article-title":"A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem","volume":"177","author":"Ruiz","year":"2007","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.swevo.2022.101143_bib0039","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/j.ejor.2012.04.034","article-title":"Local search methods for the flowshop scheduling problem with flowtime minimization","volume":"222","author":"Pan","year":"2012","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.swevo.2022.101143_bib0040","doi-asserted-by":"crossref","first-page":"4759","DOI":"10.1080\/00207543.2015.1076941","article-title":"New block properties for flowshop scheduling with blocking and their application in an iterated greedy algorithm","volume":"54","author":"Ding","year":"2016","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/j.swevo.2022.101143_bib0041","first-page":"41","article-title":"An effective iterated greedy algorithm for the mixed no-idle permutation flowshop scheduling problem","volume":"44","author":"Pan","year":"2014","journal-title":"Omega (United Kingdom)"},{"key":"10.1016\/j.swevo.2022.101143_bib0042","doi-asserted-by":"crossref","first-page":"1553","DOI":"10.1109\/TCYB.2017.2707067","article-title":"An iterated greedy heuristic for mixed no-wait flowshop problems","volume":"48","author":"Wang","year":"2018","journal-title":"IEEE Trans. Cybern."},{"key":"10.1016\/j.swevo.2022.101143_bib0043","first-page":"1","article-title":"Effective heuristics and metaheuristics to minimise total tardiness for the distributed permutation flowshop scheduling problem","volume":"0","author":"Khare","year":"2020","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/j.swevo.2022.101143_bib0044","first-page":"1","article-title":"Iterated greedy algorithms for flow-shop scheduling problems: a tutorial","author":"Zhao","year":"2021","journal-title":"IEEE Trans. Autom. Sci. Eng."},{"key":"10.1016\/j.swevo.2022.101143_bib0045","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1016\/j.ejor.2021.05.014","article-title":"The reversibility property in a job-insertion tiebreaker for the permutational flow shop scheduling problem","volume":"297","author":"Benavides","year":"2022","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.swevo.2022.101143_bib0046","article-title":"Meta-Lamarckian-based iterated greedy for optimizing distributed two-stage assembly flowshops with mixed setups","author":"Pourhejazy","year":"2022","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/j.swevo.2022.101143_bib0047","article-title":"An Effective Iterated Greedy Algorithm for a Robust Distributed Permutation Flowshop Problem With Carryover Sequence-Dependent Setup Time","author":"Jing","year":"2021","journal-title":"IEEE Trans. Syst. Man, Cybern. Syst."},{"key":"10.1016\/j.swevo.2022.101143_bib0048","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1016\/j.procs.2019.12.208","article-title":"Scheduling the distributed assembly flowshop problem to minimize the makespan","volume":"164","author":"Ochi","year":"2019","journal-title":"Procedia Comput. Sci."},{"key":"10.1016\/j.swevo.2022.101143_bib0049","doi-asserted-by":"crossref","DOI":"10.1016\/j.knosys.2021.106959","article-title":"Effective constructive heuristic and iterated greedy algorithm for distributed mixed blocking permutation flow-shop scheduling problem","volume":"221","author":"Shao","year":"2021","journal-title":"Knowl. Based Syst"},{"key":"10.1016\/j.swevo.2022.101143_bib0050","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1016\/S0377-2217(99)00387-2","article-title":"Scheduling a flowline manufacturing cell with sequence dependent family setup times","volume":"125","author":"Schaller","year":"2000","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.swevo.2022.101143_bib0051","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/0167-6377(82)90035-9","article-title":"A decomposition algorithm for the single machine total tardiness problem","volume":"1","author":"Potts","year":"1982","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/j.swevo.2022.101143_bib0052","series-title":"Design and Analysis of Experiments","author":"C.Montgomery","year":"2012"},{"key":"10.1016\/j.swevo.2022.101143_bib0053","doi-asserted-by":"crossref","DOI":"10.1016\/j.swevo.2020.100689","article-title":"Heuristics and metaheuristics for the mixed no-idle flowshop with sequence-dependent setup times and total tardiness minimisation","volume":"55","author":"Rossi","year":"2020","journal-title":"Swarm Evol. Comput."},{"key":"10.1016\/j.swevo.2022.101143_bib0054","doi-asserted-by":"crossref","first-page":"835","DOI":"10.1016\/j.ejor.2019.10.004","article-title":"Automatic algorithm design for hybrid flowshop scheduling problems","volume":"282","author":"Alfaro-Fern\u00e1ndez","year":"2020","journal-title":"Eur. J. Oper. Res."}],"container-title":["Swarm and Evolutionary Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2210650222001134?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2210650222001134?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,1,31]],"date-time":"2024-01-31T17:40:00Z","timestamp":1706722800000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S2210650222001134"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10]]},"references-count":54,"alternative-id":["S2210650222001134"],"URL":"https:\/\/doi.org\/10.1016\/j.swevo.2022.101143","relation":{},"ISSN":["2210-6502"],"issn-type":[{"value":"2210-6502","type":"print"}],"subject":[],"published":{"date-parts":[[2022,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"An effective two-stage iterated greedy algorithm to minimize total tardiness for the distributed flowshop group scheduling problem","name":"articletitle","label":"Article Title"},{"value":"Swarm and Evolutionary Computation","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.swevo.2022.101143","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":"101143"}}