{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,6]],"date-time":"2026-08-06T12:46:03Z","timestamp":1786020363946,"version":"3.56.0"},"reference-count":36,"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"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U25A20468"],"award-info":[{"award-number":["U25A20468"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62322309"],"award-info":[{"award-number":["62322309"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Expert Systems with Applications"],"published-print":{"date-parts":[[2026,12]]},"DOI":"10.1016\/j.eswa.2026.133411","type":"journal-article","created":{"date-parts":[[2026,6,30]],"date-time":"2026-06-30T13:07:01Z","timestamp":1782824821000},"page":"133411","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"PD","title":["An improved max-min ant system with multi-stage acceleration and elite refinement for non-permutation flow-shop scheduling problem"],"prefix":"10.1016","volume":"331","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-5067-8000","authenticated-orcid":false,"given":"Yuwan","family":"Wang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-5068-346X","authenticated-orcid":false,"given":"Zhenhua","family":"Yu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-8014-1662","authenticated-orcid":false,"given":"Huazhong","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3402-9018","authenticated-orcid":false,"given":"Qingchao","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4285-4739","authenticated-orcid":false,"given":"Weimin","family":"Zhong","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"19","key":"10.1016\/j.eswa.2026.133411_bib0001","doi-asserted-by":"crossref","first-page":"5962","DOI":"10.1080\/00207543.2015.1033033","article-title":"Augmented \u03b5-constraint method in multi-objective flowshop problem with past sequence set-up times and a modified learning effect","volume":"53","author":"Amirian","year":"2015","journal-title":"International Journal of Production Research"},{"key":"10.1016\/j.eswa.2026.133411_bib0002","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1016\/j.cor.2015.08.001","article-title":"Two simple and effective heuristics for minimizing the makespan in non-permutation flow shops","volume":"66","author":"Benavides","year":"2016","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.eswa.2026.133411_bib0003","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1016\/j.cor.2018.07.017","article-title":"Fast heuristics for minimizing the makespan in non-permutation flow shops","volume":"100","author":"Benavides","year":"2018","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.eswa.2026.133411_bib0004","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2021.107843","article-title":"Automatic generation of iterated greedy algorithms for the non-permutation flow shop scheduling problem with total completion time minimization","volume":"163","author":"Brum","year":"2022","journal-title":"Computers & Industrial Engineering"},{"issue":"9","key":"10.1016\/j.eswa.2026.133411_bib0005","doi-asserted-by":"crossref","first-page":"944","DOI":"10.1080\/0951192X.2015.1130247","article-title":"A hybrid genetic algorithm for non-permutation flow shop scheduling problems with unavailability constraints","volume":"29","author":"Cui","year":"2016","journal-title":"International Journal of Computer Integrated Manufacturing"},{"key":"10.1016\/j.eswa.2026.133411_bib0006","article-title":"A differential evolution algorithm for the customer order scheduling problem with sequence-dependent setup times","volume":"189","author":"de Athayde","year":"2022","journal-title":"Expert Systems with Applications"},{"issue":"1","key":"10.1016\/j.eswa.2026.133411_bib0007","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/S0377-2217(97)00019-2","article-title":"Benchmarks for shop scheduling problems","volume":"109","author":"Demirkol","year":"1998","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.eswa.2026.133411_bib0008","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2022.119077","article-title":"Efficient multi-objective meta-heuristic algorithms for energy-aware non-permutation flow-shop scheduling problem","volume":"213","author":"Goli","year":"2023","journal-title":"Expert Systems with Applications"},{"issue":"7","key":"10.1016\/j.eswa.2026.133411_bib0009","first-page":"731","article-title":"A scatter search approach for general flowshop scheduling problem","volume":"31","author":"Haq","year":"2007","journal-title":"The International Journal of Advanced Manufacturing Technology"},{"issue":"10","key":"10.1016\/j.eswa.2026.133411_bib0010","doi-asserted-by":"crossref","first-page":"4425","DOI":"10.3390\/app11104425","article-title":"Solving non-permutation flow shop scheduling problem with time couplings","volume":"11","author":"Idzikowski","year":"2021","journal-title":"Applied Sciences"},{"issue":"6","key":"10.1016\/j.eswa.2026.133411_bib0011","doi-asserted-by":"crossref","first-page":"1089","DOI":"10.1080\/00207548808947920","article-title":"General flow-shop scheduling with resource constraints","volume":"26","author":"Janiak","year":"1988","journal-title":"International Journal of Production Research"},{"issue":"1","key":"10.1016\/j.eswa.2026.133411_bib0012","doi-asserted-by":"crossref","DOI":"10.1038\/s41598-025-88124-y","article-title":"A hybrid evolution strategies algorithm for non-permutation flow shop scheduling problems","volume":"15","author":"Khurshid","year":"2025","journal-title":"Scientific Reports"},{"issue":"1","key":"10.1016\/j.eswa.2026.133411_bib0013","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1016\/S0377-2217(97)00027-1","article-title":"A new constructive heuristic for the flowshop scheduling problem","volume":"105","author":"Koulamas","year":"1998","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.eswa.2026.133411_bib0014","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2024.125624","article-title":"A two-stage hybrid flow-shop formulation for sterilization processes in hospitals","volume":"262","author":"Kraul","year":"2025","journal-title":"Expert Systems with Applications"},{"issue":"5","key":"10.1016\/j.eswa.2026.133411_bib0015","doi-asserted-by":"crossref","first-page":"1411","DOI":"10.1080\/00207540701484939","article-title":"Applying a hybrid simulated annealing and tabu search approach to non-permutation flowshop scheduling problems","volume":"47","author":"Lin","year":"2009","journal-title":"International Journal of Production Research"},{"issue":"1","key":"10.1016\/j.eswa.2026.133411_bib0016","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"},{"issue":"1","key":"10.1016\/j.eswa.2026.133411_bib0017","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1016\/0377-2217(95)00037-2","article-title":"A fast tabu search algorithm for the permutation flow-shop problem","volume":"91","author":"Nowicki","year":"1996","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.eswa.2026.133411_bib0018","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2024.126258","article-title":"Red light crossing violations modelling using deep learning and variance-based sensitivity analysis","volume":"267","author":"Owais","year":"2025","journal-title":"Expert Systems with Applications"},{"key":"10.1016\/j.eswa.2026.133411_bib0019","first-page":"1","article-title":"Integrated deep learning and global sensitivity analysis framework for transportation link criticality evaluation","author":"Owais","year":"2025","journal-title":"Transportation Research Record"},{"key":"10.1016\/j.eswa.2026.133411_bib0020","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-031-05921-6","article-title":"Scheduling: Theory, algorithms, and systems","author":"Pinedo","year":"2022"},{"key":"10.1016\/j.eswa.2026.133411_bib0021","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2024.106742","article-title":"Effective heuristics for permutation and non-permutation flow shop scheduling with missing operations","volume":"170","author":"Ritt","year":"2024","journal-title":"Computers & Operations Research"},{"issue":"6","key":"10.1016\/j.eswa.2026.133411_bib0022","doi-asserted-by":"crossref","first-page":"1221","DOI":"10.1007\/s10845-012-0724-8","article-title":"Native metaheuristics for non-permutation flowshop scheduling","volume":"25","author":"Rossi","year":"2014","journal-title":"Journal of Intelligent Manufacturing"},{"key":"10.1016\/j.eswa.2026.133411_bib0023","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/j.omega.2017.05.010","article-title":"The non-permutation flow-shop scheduling problem: A literature review","volume":"77","author":"Rossit","year":"2018","journal-title":"Omega"},{"key":"10.1016\/j.eswa.2026.133411_bib0024","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2022.119151","article-title":"Modelling and optimization of distributed heterogeneous hybrid flow shop lot-streaming scheduling problem","volume":"214","author":"Shao","year":"2023","journal-title":"Expert Systems with Applications"},{"issue":"8","key":"10.1016\/j.eswa.2026.133411_bib0025","doi-asserted-by":"crossref","first-page":"889","DOI":"10.1016\/S0167-739X(00)00043-1","article-title":"Max\u2013min ant system","volume":"16","author":"St\u00fctzle","year":"2000","journal-title":"Future Generation Computer Systems"},{"issue":"1","key":"10.1016\/j.eswa.2026.133411_bib0026","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0377-2217(90)90090-X","article-title":"Some efficient heuristic methods for the flow shop sequencing problem","volume":"47","author":"Taillard","year":"1990","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.eswa.2026.133411_bib0027","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2024.106970","article-title":"Improved linear programming relaxations for flow shop problems with makespan minimization","volume":"177","author":"Wallrath","year":"2025","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.eswa.2026.133411_bib0028","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2022.106095","article-title":"Solving non-permutation flow-shop scheduling problem via a novel deep reinforcement learning approach","volume":"151","author":"Wang","year":"2023","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.eswa.2026.133411_bib0029","first-page":"192","article-title":"Non-permutation flow shop scheduling problem based on deep reinforcement learning","volume":"27","author":"Xiao","year":"2021","journal-title":"Computer Integrated Manufacturing Systems"},{"key":"10.1016\/j.eswa.2026.133411_bib0030","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1016\/j.cie.2017.08.024","article-title":"Efficient heuristic for solving non-permutation flow-shop scheduling problems with maximal and minimal time lags","volume":"113","author":"Ye","year":"2017","journal-title":"Computers & Industrial Engineering"},{"issue":"7","key":"10.1016\/j.eswa.2026.133411_bib0031","doi-asserted-by":"crossref","first-page":"793","DOI":"10.1007\/s00170-006-0492-8","article-title":"Multi-heuristic desirability ant colony system heuristic for non-permutation flowshop scheduling problems","volume":"33","author":"Ying","year":"2007","journal-title":"The International Journal of Advanced Manufacturing Technology"},{"key":"10.1016\/j.eswa.2026.133411_bib0032","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2025.126830","article-title":"Multi-objective optimization for energy-efficient hybrid flow shop scheduling problem in panel furniture intelligent manufacturing with transportation constraints","volume":"274","author":"Yue","year":"2025","journal-title":"Expert Systems with Applications"},{"issue":"05","key":"10.1016\/j.eswa.2026.133411_bib0033","doi-asserted-by":"crossref","DOI":"10.1142\/S0217595913500140","article-title":"Flow shop scheduling with reinforcement learning","volume":"30","author":"Zhang","year":"2013","journal-title":"Asia-Pacific Journal of Operational Research"},{"issue":"9","key":"10.1016\/j.eswa.2026.133411_bib0034","doi-asserted-by":"crossref","first-page":"2492","DOI":"10.1080\/0305215X.2024.2408477","article-title":"Hybrid simulated annealing\u2013slime mould algorithm for the non-permutation flow-shop scheduling problem","volume":"57","author":"Zhao","year":"2025","journal-title":"Engineering Optimization"},{"key":"10.1016\/j.eswa.2026.133411_bib0035","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2025.128986","article-title":"A learning-based co-evolution optimization framework for energy-aware distributed heterogeneous flexible flow shop lot-streaming scheduling problem","volume":"296","author":"Zhao","year":"2026","journal-title":"Expert Systems with Applications"},{"issue":"1","key":"10.1016\/j.eswa.2026.133411_bib0036","doi-asserted-by":"crossref","DOI":"10.1080\/23311916.2016.1243982","article-title":"Non-permutation flow shop scheduling problem with preemption-dependent processing time","volume":"3","author":"Ziaee","year":"2016","journal-title":"Cogent Engineering"}],"container-title":["Expert Systems with Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0957417426023201?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0957417426023201?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,8,6]],"date-time":"2026-08-06T11:46:37Z","timestamp":1786016797000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0957417426023201"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,12]]},"references-count":36,"alternative-id":["S0957417426023201"],"URL":"https:\/\/doi.org\/10.1016\/j.eswa.2026.133411","relation":{},"ISSN":["0957-4174"],"issn-type":[{"value":"0957-4174","type":"print"}],"subject":[],"published":{"date-parts":[[2026,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"An improved max-min ant system with multi-stage acceleration and elite refinement for non-permutation flow-shop scheduling problem","name":"articletitle","label":"Article Title"},{"value":"Expert Systems with Applications","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.eswa.2026.133411","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":"133411"}}