{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T16:58:29Z","timestamp":1781283509650,"version":"3.54.1"},"reference-count":57,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Computational and Applied Mathematics"],"published-print":{"date-parts":[[2026,12]]},"DOI":"10.1016\/j.cam.2026.117834","type":"journal-article","created":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T07:27:01Z","timestamp":1780298821000},"page":"117834","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["An effective greedy randomized adaptive search procedure-based hybrid metaheuristic for the distributed no-wait flowshop scheduling problem"],"prefix":"10.1016","volume":"488","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5875-1446","authenticated-orcid":false,"given":"Ahad","family":"Beykent","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alper","family":"Hamzaday\u0131","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"M\u00fcnevver G\u00fcnay","family":"Van","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.cam.2026.117834_bib0001","doi-asserted-by":"crossref","DOI":"10.1016\/j.cam.2022.114983","article-title":"Flow shop scheduling problem with non-linear learning effects: a linear approximation scheme for non-technical users","volume":"424","author":"Ferraro","year":"2023","journal-title":"J. Comput. Appl. Math."},{"issue":"12","key":"10.1016\/j.cam.2026.117834_bib0002","doi-asserted-by":"crossref","first-page":"1243","DOI":"10.1057\/palgrave.jors.2601784","article-title":"A review and classification of heuristics for permutation flow-shop scheduling with makespan objective","volume":"55","author":"Framinan","year":"2004","journal-title":"J. Operat. Res. Soc."},{"issue":"2","key":"10.1016\/j.cam.2026.117834_bib0003","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1016\/j.ejor.2004.04.017","article-title":"A comprehensive review and evaluation of permutation flowshop heuristics","volume":"165","author":"Ruiz","year":"2005","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"10.1016\/j.cam.2026.117834_bib0004","doi-asserted-by":"crossref","first-page":"707","DOI":"10.1016\/j.ejor.2016.09.055","article-title":"A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation","volume":"257","author":"Fernandez-Viagas","year":"2017","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"10.1016\/j.cam.2026.117834_bib0005","doi-asserted-by":"crossref","first-page":"1296","DOI":"10.1016\/j.ejor.2022.03.054","article-title":"Learning to select operators in meta-heuristics: an integration of Q-learning into the iterated greedy algorithm for the permutation flowshop scheduling problem","volume":"304","author":"Karimi-Mamaghan","year":"2023","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.cam.2026.117834_bib0006","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1016\/j.isatra.2021.11.041","article-title":"Robust optimization of uncertainty-based preventive maintenance model for scheduling series\u2013parallel production systems (real case: disposable appliances production)","volume":"128","author":"Gholizadeh","year":"2022","journal-title":"ISA Trans."},{"issue":"4","key":"10.1016\/j.cam.2026.117834_bib0007","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."},{"issue":"3","key":"10.1016\/j.cam.2026.117834_bib0008","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1057\/jors.1972.52","article-title":"On the flow-shop sequencing problem with no wait in process","volume":"23","author":"Reddi","year":"1972","journal-title":"J. Operat. Res. Soc."},{"issue":"2","key":"10.1016\/j.cam.2026.117834_bib0009","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1145\/62.65","article-title":"The three-machine no-wait flow shop is NP-complete","volume":"31","author":"R\u00f6ck","year":"1984","journal-title":"J. ACM (JACM)"},{"key":"10.1016\/j.cam.2026.117834_bib0010","series-title":"Annals of Discrete Mathematics","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","article-title":"Optimization and approximation in deterministic sequencing and scheduling: a survey","author":"Graham","year":"1979"},{"key":"10.1016\/j.cam.2026.117834_bib0011","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1016\/j.cie.2016.07.027","article-title":"Minimizing makespan for solving the distributed no-wait flowshop scheduling problem","volume":"99","author":"Lin","year":"2016","journal-title":"Comput. Ind. Eng."},{"issue":"4","key":"10.1016\/j.cam.2026.117834_bib0012","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.cam.2026.117834_bib0013","first-page":"213","article-title":"Iterated greedy methods for the distributed permutation flowshop scheduling problem","volume":"83","author":"Ruiz","year":"2019","journal-title":"Omega (Westport)"},{"issue":"3","key":"10.1016\/j.cam.2026.117834_bib0014","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."},{"issue":"2","key":"10.1016\/j.cam.2026.117834_bib0015","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.cam.2026.117834_bib0016","doi-asserted-by":"crossref","DOI":"10.1016\/j.engappai.2021.104375","article-title":"A population-based iterated greedy algorithm to minimize total flowtime for the distributed blocking flowshop scheduling problem","volume":"104","author":"Chen","year":"2021","journal-title":"Eng. Appl. Artif. Intell."},{"key":"10.1016\/j.cam.2026.117834_bib0017","doi-asserted-by":"crossref","DOI":"10.1016\/j.engappai.2020.103540","article-title":"Dynamic shuffled frog-leaping algorithm for distributed hybrid flow shop scheduling with multiprocessor tasks","volume":"90","author":"Cai","year":"2020","journal-title":"Eng. Appl. Artif. Intell."},{"key":"10.1016\/j.cam.2026.117834_bib0018","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":"Eng. Appl. Artif. Intell."},{"key":"10.1016\/j.cam.2026.117834_bib0019","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.cam.2026.117834_bib0020","doi-asserted-by":"crossref","DOI":"10.1038\/s41598-023-47729-x","article-title":"A hybridization of evolution strategies with iterated greedy algorithm for no-wait flow shop scheduling problems","volume":"14","author":"Khurshid","year":"2024","journal-title":"Sci. Rep."},{"key":"10.1016\/j.cam.2026.117834_bib0021","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/s11740-017-0716-9","article-title":"General variable neighborhood search algorithm to minimize makespan of the distributed no-wait flow shop scheduling problem","volume":"11","author":"Komaki","year":"2017","journal-title":"Prod. Eng."},{"key":"10.1016\/j.cam.2026.117834_bib0022","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/j.knosys.2017.09.026","article-title":"Optimization of makespan for the distributed no-wait flow shop scheduling problem with iterated greedy algorithms","volume":"137","author":"Shao","year":"2017","journal-title":"Knowl. Based. Syst."},{"key":"10.1016\/j.cam.2026.117834_bib0023","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2022.106009","article-title":"A branch-and-cut approach for the distributed no-wait flowshop scheduling problem","volume":"148","author":"Avci","year":"2022","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cam.2026.117834_bib0024","doi-asserted-by":"crossref","DOI":"10.1016\/j.engappai.2023.105921","article-title":"An effective iterated local search algorithm for the distributed no-wait flowshop scheduling problem","volume":"120","author":"Avci","year":"2023","journal-title":"Eng. Appl. Artif. Intell."},{"issue":"17","key":"10.1016\/j.cam.2026.117834_bib0025","doi-asserted-by":"crossref","first-page":"9840","DOI":"10.3390\/app15179840","article-title":"MNATS: a multi-neighborhood adaptive tabu search algorithm for the distributed No-wait flow shop scheduling problem","volume":"15","author":"Zhang","year":"2025","journal-title":"Appl. Sci."},{"key":"10.1016\/j.cam.2026.117834_bib0026","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2020.106946","article-title":"A discrete artificial bee colony algorithm for the distributed heterogeneous no-wait flowshop scheduling problem","volume":"100","author":"Li","year":"2021","journal-title":"Appl. Soft. Comput."},{"issue":"5","key":"10.1016\/j.cam.2026.117834_bib0027","doi-asserted-by":"crossref","first-page":"6692","DOI":"10.1109\/TII.2022.3192881","article-title":"A population-based iterated greedy algorithm for distributed assembly No-wait flow-shop scheduling problem","volume":"19","author":"Zhao","year":"2023","journal-title":"IEEe Trans. Industr. Inform."},{"issue":"6","key":"10.1016\/j.cam.2026.117834_bib0028","doi-asserted-by":"crossref","first-page":"3694","DOI":"10.1109\/TSMC.2024.3370376","article-title":"A novel evolutionary algorithm for scheduling distributed No-wait flow shop problems","volume":"54","author":"Pan","year":"2024","journal-title":"IEEE Trans. Syst., Man, Cybernet.: Syst."},{"key":"10.1016\/j.cam.2026.117834_bib0029","series-title":"2017 IEEE Symposium Series on Computational Intelligence (SSCI)","article-title":"A cooperative algorithm for energy-efficient scheduling of distributed no-wait flowshop","author":"Wang","year":"2017"},{"key":"10.1016\/j.cam.2026.117834_bib0030","doi-asserted-by":"crossref","first-page":"592","DOI":"10.1016\/j.jmsy.2021.10.005","article-title":"Optimizing distributed no-wait flow shop scheduling problem with setup times and maintenance operations via iterated greedy algorithm","volume":"61","author":"Miyata","year":"2021","journal-title":"J. Manuf. Syst."},{"key":"10.1016\/j.cam.2026.117834_bib0031","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2021.105482","article-title":"Effective constructive heuristics for distributed no-wait flexible flow shop scheduling problem","volume":"136","author":"Shao","year":"2021","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cam.2026.117834_bib0032","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2021.107750","article-title":"An optimal block knowledge driven backtracking search algorithm for distributed assembly No-wait flow shop scheduling problem","volume":"112","author":"Zhao","year":"2021","journal-title":"Appl. Soft. Comput."},{"key":"10.1016\/j.cam.2026.117834_bib0033","doi-asserted-by":"crossref","DOI":"10.1016\/j.simpat.2021.102455","article-title":"Distributed no-wait flow shop problem with sequence dependent setup time: optimization of makespan and maximum tardiness","volume":"116","author":"Allali","year":"2022","journal-title":"Simul. Model. Pract. Theory."},{"key":"10.1016\/j.cam.2026.117834_bib0034","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2022.116921","article-title":"A discrete learning fruit fly algorithm based on knowledge for the distributed no-wait flow shop scheduling with due windows","volume":"198","author":"Zhu","year":"2022","journal-title":"Expert. Syst. Appl."},{"key":"10.1016\/j.cam.2026.117834_bib0035","doi-asserted-by":"crossref","DOI":"10.1016\/j.swevo.2024.101668","article-title":"A cooperative learning-aware dynamic hierarchical hyper-heuristic for distributed heterogeneous mixed no-wait flow-shop scheduling","volume":"90","author":"Zhu","year":"2024","journal-title":"Swarm. Evol. Comput."},{"issue":"2","key":"10.1016\/j.cam.2026.117834_bib0036","first-page":"366","article-title":"A hybrid whale optimization algorithm for distributed no-wait flow-shop scheduling problem with batch delivery","volume":"49","author":"Zhang","year":"2024","journal-title":"J. Intell. Fuzzy Syst.: Appl. Eng. Technol."},{"issue":"3","key":"10.1016\/j.cam.2026.117834_bib0037","doi-asserted-by":"crossref","first-page":"210","DOI":"10.3390\/machines10030210","article-title":"Deep reinforcement learning for distributed flow shop scheduling with flexible maintenance","volume":"10","author":"Yan","year":"2022","journal-title":"Machines"},{"issue":"3","key":"10.1016\/j.cam.2026.117834_bib0038","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1049\/cim2.12060","article-title":"A deep reinforcement learning based approach for dynamic distributed blocking flow shop scheduling with job insertions","volume":"4","author":"Sun","year":"2022","journal-title":"IET Collabor. Intell. Manuf."},{"issue":"3","key":"10.1016\/j.cam.2026.117834_bib0039","doi-asserted-by":"crossref","first-page":"728","DOI":"10.3390\/pr13030728","article-title":"A deep reinforcement learning-based evolutionary algorithm for distributed heterogeneous green hybrid flowshop scheduling","volume":"13","author":"Xu","year":"2025","journal-title":"Processes"},{"key":"10.1016\/j.cam.2026.117834_bib0040","article-title":"Intelligent decision-making of scheduling for dynamic permutation flowshop via Deep reinforcement learning","volume":"21","author":"Yang","year":"2021","journal-title":"Sensors"},{"key":"10.1016\/j.cam.2026.117834_bib0041","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF01096763","article-title":"Greedy randomized adaptive search procedures","volume":"6","author":"Feo","year":"1995","journal-title":"J. Glob. Optimiz."},{"key":"10.1016\/j.cam.2026.117834_bib0042","series-title":"Optimization By GRASP","author":"Resende","year":"2016"},{"key":"10.1016\/j.cam.2026.117834_bib0043","series-title":"Handbook of Metaheuristics, Chapter Greedy randomized Adaptive Search Procedures","author":"Resende","year":"2003"},{"issue":"1","key":"10.1016\/j.cam.2026.117834_bib0044","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/0305-0548(93)E0015-L","article-title":"A genetic algorithm for the job shop problem","volume":"22","author":"Della Croce","year":"1995","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"10.1016\/j.cam.2026.117834_bib0045","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1287\/ijoc.7.1.10","article-title":"A GRASP for the vehicle routing problem with time windows","volume":"7","author":"Kontoravdis","year":"1995","journal-title":"ORSA J. Comput."},{"issue":"4","key":"10.1016\/j.cam.2026.117834_bib0046","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1109\/MIS.2005.57","article-title":"A GRASP approach to the container-loading problem","volume":"20","author":"Moura","year":"2005","journal-title":"IEEe Intell. Syst."},{"issue":"11","key":"10.1016\/j.cam.2026.117834_bib0047","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","article-title":"Variable neighborhood search","volume":"24","author":"Mladenovi\u0107","year":"1997","journal-title":"Comput. Oper. Res."},{"issue":"10","key":"10.1016\/j.cam.2026.117834_bib0048","doi-asserted-by":"crossref","first-page":"917","DOI":"10.1016\/S0305-0548(99)00067-2","article-title":"A greedy genetic algorithm for the quadratic assignment problem","volume":"27","author":"Ahuja","year":"2000","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"10.1016\/j.cam.2026.117834_bib0049","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1287\/opre.1060.0358","article-title":"A decomposition-based genetic algorithm for the resource-constrained project-scheduling problem","volume":"55","author":"Debels","year":"2007","journal-title":"Oper. Res."},{"issue":"12","key":"10.1016\/j.cam.2026.117834_bib0050","doi-asserted-by":"crossref","first-page":"1141","DOI":"10.1177\/0037549718811591","article-title":"Scheduling elective patients based on sequence-dependent setup times in an open-heart surgical department using an optimization and simulation approach","volume":"95","author":"Hamid","year":"2019","journal-title":"Simulation."},{"key":"10.1016\/j.cam.2026.117834_bib0051","first-page":"25","article-title":"Practical bayesian optimization of machine learning algorithms","author":"Snoek","year":"2012","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"10.1016\/j.cam.2026.117834_bib0052","series-title":"2016 IEEE Congress on Evolutionary Computation (CEC)","article-title":"Bayesian optimization for parameter tuning in evolutionary algorithms","author":"Roman","year":"2016"},{"key":"10.1016\/j.cam.2026.117834_bib0053","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1016\/j.procs.2015.09.207","article-title":"A bayesian optimization-based evolutionary algorithm for flexible job shop scheduling","volume":"61","author":"Sun","year":"2015","journal-title":"Procedia Comput. Sci."},{"issue":"4","key":"10.1016\/j.cam.2026.117834_bib0054","doi-asserted-by":"crossref","first-page":"3297","DOI":"10.1016\/j.asoc.2010.11.029","article-title":"Task scheduling using bayesian optimization algorithm for heterogeneous computing environments","volume":"11","author":"Yang","year":"2011","journal-title":"Appl. Soft. Comput."},{"key":"10.1016\/j.cam.2026.117834_bib0055","first-page":"1","article-title":"A Bayesian optimization approach for tuning a genetic algorithm solving practical-oriented pickup and delivery problems","author":"Ruther","year":"2021","journal-title":"IEEE Trans. Autom. Sci. Eng."},{"key":"10.1016\/j.cam.2026.117834_bib0056","series-title":"2022 International Conference on Unmanned Aircraft Systems (ICUAS)","article-title":"Heterogenous vehicle routing: comparing parameter tuning using genetic algorithm and bayesian optimization","author":"Ramasamy","year":"2022"},{"issue":"2","key":"10.1016\/j.cam.2026.117834_bib0057","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1016\/0377-2217(93)90182-M","article-title":"Benchmarks for basic scheduling problems","volume":"64","author":"Taillard","year":"1993","journal-title":"Eur. J. Oper. Res."}],"container-title":["Journal of Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377042726004760?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377042726004760?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T16:13:43Z","timestamp":1781280823000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377042726004760"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,12]]},"references-count":57,"alternative-id":["S0377042726004760"],"URL":"https:\/\/doi.org\/10.1016\/j.cam.2026.117834","relation":{},"ISSN":["0377-0427"],"issn-type":[{"value":"0377-0427","type":"print"}],"subject":[],"published":{"date-parts":[[2026,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"An effective greedy randomized adaptive search procedure-based hybrid metaheuristic for the distributed no-wait flowshop scheduling problem","name":"articletitle","label":"Article Title"},{"value":"Journal of Computational and Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.cam.2026.117834","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"}],"article-number":"117834"}}