{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T12:17:32Z","timestamp":1783167452987,"version":"3.54.6"},"reference-count":50,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"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":["62273221"],"award-info":[{"award-number":["62273221"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100007101","name":"Liaocheng University","doi-asserted-by":"publisher","award":["318052378"],"award-info":[{"award-number":["318052378"]}],"id":[{"id":"10.13039\/501100007101","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2026,10]]},"DOI":"10.1016\/j.ejor.2026.04.034","type":"journal-article","created":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T16:01:36Z","timestamp":1776873696000},"page":"23-39","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"title":["Heuristic algorithms based on multi-stage or adaptive strategies for a distributed heterogeneous permutation flowshop scheduling problem with release time"],"prefix":"10.1016","volume":"334","author":[{"ORCID":"https:\/\/orcid.org\/0009-0009-8797-8514","authenticated-orcid":false,"given":"Qi","family":"Cheng","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6181-6551","authenticated-orcid":false,"given":"Xue-Lei","family":"Jing","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Quan-Ke","family":"Pan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bao-Xian","family":"Jia","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.ejor.2026.04.034_bib0001","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2023.109716","article-title":"Mathematical models for multi-stage hybrid assembly flow-shop scheduling with preventive maintenance and release times","volume":"186","author":"Anunay Alexander","year":"2023","journal-title":"Computers & Industrial Engineering"},{"issue":"22","key":"10.1016\/j.ejor.2026.04.034_bib0002","doi-asserted-by":"crossref","first-page":"6750","DOI":"10.1080\/00207543.2021.1923854","article-title":"Competitive bi-agent flowshop scheduling to minimise the weighted combination of makespans","volume":"60","author":"Bai","year":"2022","journal-title":"International Journal of Production Research"},{"key":"10.1016\/j.ejor.2026.04.034_bib0003","first-page":"1","article-title":"Scheduling a distributed permutation flowshop with uniform machines and release dates","author":"Bai","year":"2024","journal-title":"IEEE Transactions on Automation Science and Engineering"},{"key":"10.1016\/j.ejor.2026.04.034_bib0004","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/j.omega.2017.10.002","article-title":"Flow shop learning effect scheduling problem with release dates","volume":"78","author":"Bai","year":"2018","journal-title":"Omega"},{"issue":"10","key":"10.1016\/j.ejor.2026.04.034_bib0005","doi-asserted-by":"crossref","first-page":"4929","DOI":"10.1109\/TCYB.2025.3594063","article-title":"An end-to-end framework for energy-efficient cascaded dual-shop collaborative scheduling with mating operations","volume":"55","author":"Bao","year":"2025","journal-title":"IEEE Transactions on Cybernetics, early access"},{"key":"10.1016\/j.ejor.2026.04.034_bib0006","doi-asserted-by":"crossref","DOI":"10.1016\/j.swevo.2024.101764","article-title":"A collaborative-learning multi-agent reinforcement learning method for distributed hybrid flow shop scheduling problem","volume":"91","author":"Di","year":"2024","journal-title":"Swarm and Evolutionary Computation"},{"key":"10.1016\/j.ejor.2026.04.034_bib0007","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2023.121790","article-title":"A tabu memory based iterated greedy algorithm for the distributed heterogeneous permutation flowshop scheduling problem with the total tardiness criterion","volume":"238","author":"Feng","year":"2024","journal-title":"Expert Systems with Applications"},{"key":"10.1016\/j.ejor.2026.04.034_bib0008","doi-asserted-by":"crossref","DOI":"10.1016\/j.swevo.2021.100869","article-title":"Two novel population based algorithms for the single machine scheduling problem with sequence dependent setup times and release times","volume":"63","author":"Fernandez-Viagas","year":"2021","journal-title":"Swarm and Evolutionary Computation"},{"key":"10.1016\/j.ejor.2026.04.034_bib0009","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":"Computers & Industrial Engineering"},{"issue":"3","key":"10.1016\/j.ejor.2026.04.034_bib0010","doi-asserted-by":"crossref","first-page":"783","DOI":"10.1016\/j.ejor.2024.11.026","article-title":"A speed-up procedure and new heuristics for the classical job shop scheduling problem: A computational evaluation","volume":"322","author":"Fernandez-Viagas","year":"2025","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2026.04.034_bib0011","doi-asserted-by":"crossref","DOI":"10.1016\/j.engappai.2023.106347","article-title":"An effective fruit fly optimization algorithm for the distributed permutation flowshop scheduling problem with total flowtime","volume":"123","author":"Guo","year":"2023","journal-title":"Engineering Applications of Artificial Intelligence"},{"issue":"12","key":"10.1016\/j.ejor.2026.04.034_bib0012","doi-asserted-by":"crossref","first-page":"4245","DOI":"10.1080\/00207543.2023.2255681","article-title":"A cooperative iterated greedy algorithm for the serial distributed permutation flowshop scheduling problem","volume":"62","author":"Han","year":"2024","journal-title":"International Journal of Production Research"},{"key":"10.1016\/j.ejor.2026.04.034_bib0013","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2020.114282","article-title":"Multi-objective evolutionary algorithms with heuristic decoding for hybrid flow shop scheduling problem with worker constraint","volume":"168","author":"Han","year":"2021","journal-title":"Expert Systems with Applications"},{"issue":"2","key":"10.1016\/j.ejor.2026.04.034_bib0014","doi-asserted-by":"crossref","first-page":"436","DOI":"10.1016\/j.ejor.2025.02.009","article-title":"Minimising makespan and total tardiness for the flowshop group scheduling problem with sequence dependent setup times","volume":"324","author":"He","year":"2025","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"10.1016\/j.ejor.2026.04.034_bib0015","doi-asserted-by":"crossref","first-page":"430","DOI":"10.1109\/TEVC.2021.3115795","article-title":"A greedy cooperative Co-evolutionary algorithm with problem-specific knowledge for multiobjective flowshop group scheduling problems","volume":"27","author":"He","year":"2023","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"10.1016\/j.ejor.2026.04.034_bib0016","doi-asserted-by":"crossref","DOI":"10.1016\/j.engappai.2020.104016","article-title":"Effective constructive heuristics and discrete bee colony optimization for distributed flowshop with setup times","volume":"97","author":"Huang","year":"2021","journal-title":"Engineering Applications of Artificial Intelligence"},{"issue":"10","key":"10.1016\/j.ejor.2026.04.034_bib0017","doi-asserted-by":"crossref","first-page":"1758","DOI":"10.1080\/0305215X.2021.1983806","article-title":"Effective constructive and composite heuristics for grouping printed circuit boards in the electronic assembly industry","volume":"54","author":"Huang","year":"2022","journal-title":"Engineering Optimization"},{"issue":"9","key":"10.1016\/j.ejor.2026.04.034_bib0018","doi-asserted-by":"crossref","first-page":"5783","DOI":"10.1109\/TSMC.2021.3131849","article-title":"An effective iterated greedy algorithm for a robust distributed permutation flowshop problem with carryover sequence-dependent setup time","volume":"52","author":"Jing","year":"2022","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics: Systems"},{"key":"10.1016\/j.ejor.2026.04.034_bib0019","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":"Applied Soft Computing"},{"key":"10.1016\/j.ejor.2026.04.034_bib0020","doi-asserted-by":"crossref","DOI":"10.1016\/j.swevo.2024.101580","article-title":"An iterated greedy algorithm with acceleration of job allocation probability for distributed heterogeneous permutation flowshop scheduling problem","volume":"88","author":"Li","year":"2024","journal-title":"Swarm and Evolutionary Computation"},{"key":"10.1016\/j.ejor.2026.04.034_bib0021","first-page":"1","article-title":"Dynamic cascaded flow-shop scheduling using an evolutionary greedy algorithm","author":"Li","year":"2025","journal-title":"IEEE Transactions on Evolutionary Computation"},{"issue":"17","key":"10.1016\/j.ejor.2026.04.034_bib0022","doi-asserted-by":"crossref","first-page":"5934","DOI":"10.1080\/00207543.2022.2119294","article-title":"Batching and scheduling in a continuous-discrete hybrid flowshop: Lagrangian relaxation-based heuristic algorithms","volume":"61","author":"Li","year":"2023","journal-title":"International Journal of Production Research"},{"key":"10.1016\/j.ejor.2026.04.034_bib0023","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2023.120830","article-title":"An iterated greedy algorithm for distributed flowshops with tardiness and rejection costs to maximize total profit","volume":"233","author":"Lin","year":"2023","journal-title":"Expert Systems with Applications"},{"key":"10.1016\/j.ejor.2026.04.034_bib0024","doi-asserted-by":"crossref","DOI":"10.1016\/j.engappai.2023.106454","article-title":"Problem-specific knowledge MOEA\/D for energy-efficient scheduling of distributed permutation flow shop in heterogeneous factories","volume":"123","author":"Luo","year":"2023","journal-title":"Engineering Applications of Artificial Intelligence"},{"key":"10.1016\/j.ejor.2026.04.034_bib0025","doi-asserted-by":"crossref","DOI":"10.1016\/j.swevo.2024.101497","article-title":"A Q-learning memetic algorithm for energy-efficient heterogeneous distributed assembly permutation flowshop scheduling considering priorities","volume":"85","author":"Luo","year":"2024","journal-title":"Swarm and Evolutionary Computation"},{"key":"10.1016\/j.ejor.2026.04.034_bib0026","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2020.114495","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":"Mao","year":"2021","journal-title":"Expert Systems with Applications"},{"key":"10.1016\/j.ejor.2026.04.034_bib0027","doi-asserted-by":"crossref","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":"Knowledge-Based Systems"},{"key":"10.1016\/j.ejor.2026.04.034_bib0028","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 and Evolutionary Computation"},{"issue":"4","key":"10.1016\/j.ejor.2026.04.034_bib0029","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":"Computers & Operations Research"},{"key":"10.1016\/j.ejor.2026.04.034_bib0030","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 Systems with Applications"},{"issue":"6","key":"10.1016\/j.ejor.2026.04.034_bib0031","doi-asserted-by":"crossref","first-page":"3818","DOI":"10.1109\/TCYB.2022.3164165","article-title":"Solving biobjective distributed flow-shop scheduling problems with lot-streaming using an improved Jaya algorithm","volume":"53","author":"Pan","year":"2023","journal-title":"IEEE Transactions on Cybernetics"},{"issue":"1","key":"10.1016\/j.ejor.2026.04.034_bib0032","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2023.02.001","article-title":"A review and classification on distributed permutation flowshop scheduling problems","volume":"312","author":"Perez-Gonzalez","year":"2024","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"10.1016\/j.ejor.2026.04.034_bib0033","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/S0377-2217(96)00273-1","article-title":"An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs","volume":"103","author":"Rajendran","year":"1997","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2026.04.034_bib0034","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/j.omega.2018.03.004","article-title":"Iterated greedy methods for the distributed permutation flowshop scheduling problem","volume":"83","author":"Ruiz","year":"2019","journal-title":"Omega"},{"key":"10.1016\/j.ejor.2026.04.034_bib0035","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":"Knowledge-Based Systems"},{"issue":"1","key":"10.1016\/j.ejor.2026.04.034_bib0036","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1007\/s10479-013-1368-6","article-title":"Some results of the worst-case analysis for flow shop scheduling with a learning effect","volume":"211","author":"Sun","year":"2013","journal-title":"Annals of Operations Research"},{"issue":"12","key":"10.1016\/j.ejor.2026.04.034_bib0037","doi-asserted-by":"crossref","first-page":"2674","DOI":"10.1080\/01605682.2020.1806746","article-title":"Flow shop scheduling with general position weighted learning effects to minimise total weighted completion time","volume":"72","author":"Sun","year":"2021","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/j.ejor.2026.04.034_bib0038","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2023.121723","article-title":"A DQL-NSGA-III algorithm for solving the flexible job shop dynamic scheduling problem","volume":"237","author":"Tang","year":"2024","journal-title":"Expert Systems with Applications"},{"key":"10.1016\/j.ejor.2026.04.034_bib0039","first-page":"1","article-title":"An iterated greedy algorithm with reinforcement learning for distributed hybrid FlowShop problems with job merging","author":"Tao","year":"2024","journal-title":"IEEE Transactions on Evolutionary Computation"},{"issue":"2 Series II","key":"10.1016\/j.ejor.2026.04.034_bib0040","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1111\/j.2164-0947.1953.tb01326.x","article-title":"Some selected quick and easy methods of statistical analysis","volume":"16","author":"Tukey","year":"1953","journal-title":"Transactions of the New York Academy of Sciences"},{"issue":"3","key":"10.1016\/j.ejor.2026.04.034_bib0041","doi-asserted-by":"crossref","first-page":"816","DOI":"10.1016\/j.ejor.2023.05.010","article-title":"Intelligent optimization under the makespan constraint: Rapid evaluation mechanisms based on the critical machine for the distributed flowshop group scheduling problem","volume":"311","author":"Wang","year":"2023","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"10.1016\/j.ejor.2026.04.034_bib0042","doi-asserted-by":"crossref","first-page":"778","DOI":"10.1016\/j.ejor.2025.08.039","article-title":"Logic-based benders decomposition methods for the distributed flexible job shop scheduling problem","volume":"329","author":"Xiong","year":"2025","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2026.04.034_bib0043","first-page":"1","article-title":"Double-learning-strategy-based evolutionary algorithm for scheduling multiobjective distributed assembly permutation flowshops with setup time","author":"Yu","year":"2024","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics: Systems"},{"key":"10.1016\/j.ejor.2026.04.034_bib0044","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2023.110029","article-title":"Acceleration-based artificial bee colony optimizer for a distributed permutation flowshop scheduling problem with sequence-dependent setup times","volume":"135","author":"Yu","year":"2023","journal-title":"Applied Soft Computing"},{"key":"10.1016\/j.ejor.2026.04.034_bib0045","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2023.106432","article-title":"Automatic design of constructive heuristics for a reconfigurable distributed flowshop group scheduling problem[J]","volume":"161","author":"Zhang","year":"2024","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.ejor.2026.04.034_bib0046","doi-asserted-by":"crossref","DOI":"10.1016\/j.ins.2025.122023","article-title":"Integrated heterogeneous graph and reinforcement learning enabled efficient scheduling for surface Mount technology workshop[J]","volume":"708","author":"Zhang","year":"2025","journal-title":"Information Sciences"},{"key":"10.1016\/j.ejor.2026.04.034_bib0047","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2025.130422","article-title":"A two-stage iterated greedy algorithm for distributed blocking flowshop scheduling problem[J]","volume":"300","author":"Zhang","year":"2026","journal-title":"Expert Systems with Applications"},{"key":"10.1016\/j.ejor.2026.04.034_bib0048","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2024.112436","article-title":"A multi-strategy fruit fly optimization algorithm for the distributed permutation flowshop scheduling problem with sequence-dependent setup times","volume":"167","author":"Zhao","year":"2024","journal-title":"Applied Soft Computing"},{"issue":"1","key":"10.1016\/j.ejor.2026.04.034_bib0049","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/s40747-021-00354-5","article-title":"A memetic discrete differential evolution algorithm for the distributed permutation flow shop scheduling problem","volume":"8","author":"Zhao","year":"2022","journal-title":"Complex & Intelligent Systems"},{"key":"10.1016\/j.ejor.2026.04.034_bib0050","doi-asserted-by":"crossref","DOI":"10.1016\/j.engappai.2023.106750","article-title":"A cooperative population-based iterated greedy algorithm for distributed permutation flowshop group scheduling problem","volume":"125","author":"Zhao","year":"2023","journal-title":"Engineering Applications of Artificial Intelligence"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221726003899?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221726003899?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T11:37:06Z","timestamp":1783165026000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221726003899"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,10]]},"references-count":50,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,10]]}},"alternative-id":["S0377221726003899"],"URL":"https:\/\/doi.org\/10.1016\/j.ejor.2026.04.034","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2026,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Heuristic algorithms based on multi-stage or adaptive strategies for a distributed heterogeneous permutation flowshop scheduling problem with release time","name":"articletitle","label":"Article Title"},{"value":"European Journal of Operational Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ejor.2026.04.034","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}]}}