{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T15:05:14Z","timestamp":1774883114117,"version":"3.50.1"},"reference-count":51,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100004763","name":"Inner Mongolia Autonomous Region Natural Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004763","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001809","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,7]]},"DOI":"10.1016\/j.cor.2026.107466","type":"journal-article","created":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T15:57:19Z","timestamp":1773676639000},"page":"107466","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["A dual-agent neighborhood search algorithm for solving hybrid flowshop scheduling problem"],"prefix":"10.1016","volume":"191","author":[{"given":"Chengshuai","family":"Li","sequence":"first","affiliation":[]},{"given":"Hongfei","family":"Guo","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7702-1684","authenticated-orcid":false,"given":"Yaping","family":"Ren","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1439-4832","authenticated-orcid":false,"given":"Leilei","family":"Meng","sequence":"additional","affiliation":[]},{"given":"Yuyan","family":"Han","sequence":"additional","affiliation":[]},{"given":"Chaoyong","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.cor.2026.107466_b0005","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1109\/MSP.2017.2743240","article-title":"Deep reinforcement learning: a brief survey","volume":"34","author":"Arulkumaran","year":"2017","journal-title":"IEEE Signal Process Mag."},{"key":"10.1016\/j.cor.2026.107466_b0010","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. Intel."},{"key":"10.1016\/j.cor.2026.107466_b0015","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/S0925-5273(99)00048-1","article-title":"Hybrid flow shop scheduling with precedence constraints and time lags to minimize maximum lateness","volume":"64","author":"Botta-Genoulaz","year":"2000","journal-title":"Int. J. Prod. Econ."},{"key":"10.1016\/j.cor.2026.107466_b0020","doi-asserted-by":"crossref","first-page":"1233","DOI":"10.1080\/00207543.2022.2031331","article-title":"A novel shuffled frog-leaping algorithm with reinforcement learning for distributed assembly hybrid flow shop scheduling","volume":"61","author":"Cai","year":"2023","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/j.cor.2026.107466_b0025","doi-asserted-by":"crossref","DOI":"10.1016\/j.swevo.2024.101771","article-title":"A knowledge-driven many-objective algorithm for energy-efficient distributed heterogeneous hybrid flowshop scheduling with lot-streaming","volume":"91","author":"Chen","year":"2024","journal-title":"Swarm Evol. Comput."},{"key":"10.1016\/j.cor.2026.107466_b0030","series-title":"IFAC Proceedings Volumes, 7th IFAC Conference on Manufacturing Modelling, Management, and Control 46","first-page":"448","article-title":"Two-stage, multiple-lot, lot streaming problem for a 1 + 2 hybrid flow shop","author":"Cheng","year":"2013"},{"key":"10.1016\/j.cor.2026.107466_b0035","doi-asserted-by":"crossref","first-page":"1024","DOI":"10.1109\/TCYB.2023.3336656","article-title":"A reinforcement-learning-based 3-D estimation of distribution algorithm for fuzzy distributed hybrid flow-shop scheduling considering on-time-delivery","volume":"54","author":"Deng","year":"2024","journal-title":"IEEE Trans. Cybern."},{"key":"10.1016\/j.cor.2026.107466_b0040","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1016\/j.cie.2017.10.034","article-title":"Efficient heuristics for the hybrid flow shop scheduling problem with missing operations","volume":"115","author":"Dios","year":"2018","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.cor.2026.107466_b0045","doi-asserted-by":"crossref","first-page":"1752","DOI":"10.1109\/TCYB.2021.3120875","article-title":"A hybrid evolutionary algorithm using two solution representations for hybrid flow-shop scheduling problem","volume":"53","author":"Fan","year":"2021","journal-title":"IEEE Trans. Cybern."},{"key":"10.1016\/j.cor.2026.107466_b0050","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1016\/j.cie.2010.06.006","article-title":"Heuristic algorithms for preemptive scheduling in a two-stage hybrid flowshop with additional renewable resources at each stage","volume":"59","author":"Fcccigielska","year":"2010","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.cor.2026.107466_b0055","doi-asserted-by":"crossref","first-page":"599","DOI":"10.1016\/j.cor.2003.08.007","article-title":"Total completion time minimization in a computer system with a server and two parallel processors","volume":"32","author":"Guirchoun","year":"2005","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2026.107466_b0060","doi-asserted-by":"crossref","first-page":"2307","DOI":"10.1080\/00207543.2022.2069524","article-title":"Optimizing a stochastic disassembly line balancing problem with task failure via a hybrid variable neighborhood descent-artificial bee colony algorithm","volume":"61","author":"Guo","year":"2023","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/j.cor.2026.107466_b0065","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1142\/S0217595907001036","article-title":"A hybrid two-stage flowshop scheduling problem","volume":"24","author":"He","year":"2007","journal-title":"Asia Pac. J. Oper. Res."},{"key":"10.1016\/j.cor.2026.107466_b0070","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2023.109650","article-title":"A cooperative hierarchical deep reinforcement learning based multi-agent method for distributed job shop scheduling problem with random job arrivals","volume":"185","author":"Huang","year":"2023","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.cor.2026.107466_b0075","doi-asserted-by":"crossref","first-page":"628","DOI":"10.1007\/s42452-021-04615-3","article-title":"A hybrid genetic local and global search algorithm for solving no-wait flow shop problem with bi criteria","volume":"3","author":"Keskin","year":"2021","journal-title":"SN Appl. Sci."},{"key":"10.1016\/j.cor.2026.107466_b0080","first-page":"592","article-title":"A review of exact solution methods for the non-preemptive multiprocessor flowshop problem","volume":"164","author":"Kis","year":"2005","journal-title":"Eur. J. Operat. Res., Recent Adv. Schedul. Comput. Manuf. Syst."},{"key":"10.1016\/j.cor.2026.107466_b0085","doi-asserted-by":"crossref","first-page":"4731","DOI":"10.1080\/0020754041233127044","article-title":"A branch-and-bound algorithm for a two-stage hybrid flowshop scheduling problem minimizing total tardiness","volume":"42","author":"Lee","year":"2004","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/j.cor.2026.107466_b0090","doi-asserted-by":"crossref","first-page":"4076","DOI":"10.1080\/00207543.2023.2253925","article-title":"A novel collaborative iterative greedy algorithm for hybrid flowshop scheduling problem with batch processing machines and variable sublots","volume":"62","author":"Li","year":"2024","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/j.cor.2026.107466_b0095","doi-asserted-by":"crossref","unstructured":"Li, C., Zhang, B., Han, Y., Wang, Y., Li, J., Gao, K., 2023. Energy-efficient hybrid flowshop scheduling with consistent sublots using an improved cooperative coevolutionary algorithm.","DOI":"10.3390\/math11010077"},{"key":"10.1016\/j.cor.2026.107466_b0100","doi-asserted-by":"crossref","first-page":"7291","DOI":"10.1109\/TSMC.2024.3449413","article-title":"A hybrid graph-based imitation learning method for a realistic distributed hybrid flow shop with family setup time","volume":"54","author":"Li","year":"2024","journal-title":"IEEE Trans. Syst., Man, Cybernet. Syst."},{"key":"10.1016\/j.cor.2026.107466_b0105","doi-asserted-by":"crossref","DOI":"10.1016\/j.engappai.2024.108775","article-title":"Evolutionary computation and reinforcement learning integrated algorithm for distributed heterogeneous flowshop scheduling","volume":"135","author":"Li","year":"2024","journal-title":"Eng. Appl. Artif. Intel."},{"key":"10.1016\/j.cor.2026.107466_b0110","doi-asserted-by":"crossref","first-page":"3880","DOI":"10.1080\/00207543.2020.1753897","article-title":"A discrete artificial bee colony algorithm for distributed hybrid flowshop scheduling problem with sequence-dependent setup times","volume":"59","author":"Li","year":"2021","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/j.cor.2026.107466_b0115","doi-asserted-by":"crossref","DOI":"10.1016\/j.jclepro.2019.119071","article-title":"The mixed production mode considering continuous and intermittent processing for an energy-efficient hybrid flow shop scheduling","volume":"246","author":"Liu","year":"2020","journal-title":"J. Clean. Prod."},{"key":"10.1016\/j.cor.2026.107466_b0120","article-title":"An improved iterated greedy algorithm for the distributed hybrid flowshop scheduling problem","author":"Lu","year":"2024","journal-title":"Eng. Optim."},{"key":"10.1016\/j.cor.2026.107466_b0125","doi-asserted-by":"crossref","DOI":"10.1016\/j.engappai.2024.108487","article-title":"A double Deep Q-Network framework for a flexible job shop scheduling problem with dynamic job arrivals and urgent job insertions","volume":"133","author":"Lu","year":"2024","journal-title":"Eng. Appl. Artif. Intel."},{"key":"10.1016\/j.cor.2026.107466_b0130","doi-asserted-by":"crossref","first-page":"8455","DOI":"10.1109\/TSMC.2025.3604355","article-title":"Novel CP models and CP-Assisted meta-heuristic algorithm for flexible job shop scheduling benchmark problem with multi-AGV","volume":"55","author":"Meng","year":"2025","journal-title":"IEEE Trans. Syst., Man, Cybernet. Syst."},{"key":"10.1016\/j.cor.2026.107466_b0135","doi-asserted-by":"crossref","DOI":"10.1016\/j.swevo.2022.101058","article-title":"Novel MILP and CP models for distributed hybrid flowshop scheduling problem with sequence-dependent setup times","volume":"71","author":"Meng","year":"2022","journal-title":"Swarm Evol. Comput."},{"key":"10.1016\/j.cor.2026.107466_b0140","doi-asserted-by":"crossref","first-page":"3905","DOI":"10.1080\/00207543.2019.1636324","article-title":"More MILP models for hybrid flow shop scheduling problem and its extended problems","volume":"58","author":"Meng","year":"2020","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/j.cor.2026.107466_b0145","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1038\/nature14236","article-title":"Human-level control through deep reinforcement learning","volume":"518","author":"Mnih","year":"2015","journal-title":"Nature"},{"key":"10.1016\/j.cor.2026.107466_b0150","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2022.08.009","article-title":"A systematic review of multi-objective hybrid flow shop scheduling","volume":"309","author":"Neufeld","year":"2023","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.cor.2026.107466_b0155","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1007\/s10951-005-1640-y","article-title":"A genetic algorithm for hybrid flow-shop scheduling with multiprocessor tasks","volume":"8","author":"O\u011duz","year":"2005","journal-title":"J. Sched."},{"key":"10.1016\/j.cor.2026.107466_b0160","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/j.cor.2019.06.009","article-title":"Metaheuristic algorithms for the hybrid flowshop scheduling problem","volume":"111","author":"\u00d6ztop","year":"2019","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2026.107466_b0165","first-page":"89","article-title":"Effective metaheuristics for scheduling a hybrid flowshop with sequence-dependent setup times","volume":"303","author":"Pan","year":"2017","journal-title":"Appl. Math Comput."},{"key":"10.1016\/j.cor.2026.107466_b0170","doi-asserted-by":"crossref","first-page":"1442","DOI":"10.1109\/TETCI.2023.3271331","article-title":"Energy-efficient iterative greedy algorithm for the distributed hybrid flow shop scheduling with blocking constraints","volume":"7","author":"Qin","year":"2023","journal-title":"IEEE Trans. Emerg. Top. Comput. Intell."},{"key":"10.1016\/j.cor.2026.107466_b0175","doi-asserted-by":"crossref","first-page":"11889","DOI":"10.1109\/TII.2023.3253877","article-title":"A self-adaptive learning approach for uncertain disassembly planning based on extended petri net","volume":"19","author":"Ren","year":"2023","journal-title":"IEEE Trans. Ind. Inf."},{"key":"10.1016\/j.cor.2026.107466_b0180","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2020.113752","article-title":"An improved general variable neighborhood search for a static bike-sharing rebalancing problem considering the depot inventory","volume":"160","author":"Ren","year":"2020","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.cor.2026.107466_b0185","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2009.09.024","article-title":"The hybrid flow shop scheduling problem","volume":"205","author":"Ruiz","year":"2010","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.cor.2026.107466_b0190","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/j.mcm.2003.10.053","article-title":"Integer programming approach to production scheduling for make-to-order manufacturing","volume":"41","author":"Sawik","year":"2005","journal-title":"Math. Comput. Model."},{"key":"10.1016\/j.cor.2026.107466_b0195","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 Syst. Appl."},{"key":"10.1016\/j.cor.2026.107466_b0200","article-title":"An iterated greedy algorithm with reinforcement learning for distributed hybrid flowshop problems with job merging","volume":"1\u20131","author":"Tao","year":"2024","journal-title":"IEEE Trans. Evol. Computat."},{"key":"10.1016\/j.cor.2026.107466_b0205","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1504\/IJAOM.2020.108263","article-title":"A literature review on hybrid flow shop scheduling","volume":"12","author":"Tosun","year":"2020","journal-title":"Int. J. Adv. Operat. Manage."},{"key":"10.1016\/j.cor.2026.107466_b0210","doi-asserted-by":"crossref","first-page":"695","DOI":"10.1016\/j.cie.2007.09.005","article-title":"A note on two-stage hybrid flowshop scheduling with missing operations","volume":"54","author":"Tseng","year":"2008","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.cor.2026.107466_b0215","article-title":"Energy-efficient optimization for distributed blocking hybrid flowshop scheduling: a self-regulating iterative greedy algorithm under makespan constraint","author":"Wang","year":"2024","journal-title":"Optim. Eng."},{"key":"10.1016\/j.cor.2026.107466_b0220","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1016\/j.asoc.2016.12.021","article-title":"An effective modified migrating birds optimization for hybrid flowshop scheduling problem with lot streaming","volume":"52","author":"Zhang","year":"2017","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.cor.2026.107466_b0225","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2021.107305","article-title":"A collaborative variable neighborhood descent algorithm for the hybrid flowshop scheduling problem with consistent sublots","volume":"106","author":"Zhang","year":"2021","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.cor.2026.107466_b0230","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2024.125374","article-title":"An accelerated discrete artificial bee colony algorithm under the makespan constraint: solving the distributed blocking flow shop scheduling problem with balanced energy consumption costs","volume":"260","author":"Zhang","year":"2025","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.cor.2026.107466_b0235","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2023.121570","article-title":"A multiobjective memetic algorithm with particle swarm optimization and Q-learning-based local search for energy-efficient distributed heterogeneous hybrid flow-shop scheduling problem","volume":"237","author":"Zhang","year":"2024","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.cor.2026.107466_b0240","article-title":"MRLM: a meta-reinforcement learning-based metaheuristic for hybrid flow-shop scheduling problem with learning and forgetting effects","author":"Zhang","year":"2024","journal-title":"Swarm Evol. Comput."},{"key":"10.1016\/j.cor.2026.107466_b0245","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2023.109802","article-title":"The application of heterogeneous graph neural network and deep reinforcement learning in hybrid flow shop scheduling problem","volume":"187","author":"Zhao","year":"2024","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.cor.2026.107466_b0250","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1007\/s001700300005","article-title":"An effective hybrid heuristic for flow shop scheduling","volume":"21","author":"Zheng","year":"2003","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"10.1016\/j.cor.2026.107466_b0255","doi-asserted-by":"crossref","first-page":"2609","DOI":"10.1080\/0305215X.2024.2410844","article-title":"A Q-learning multi-objective grey wolf optimizer for the distributed hybrid flowshop scheduling problem","volume":"57","author":"Zheng","year":"2025","journal-title":"Eng. Optim."}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054826000845?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054826000845?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T14:30:57Z","timestamp":1774881057000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054826000845"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7]]},"references-count":51,"alternative-id":["S0305054826000845"],"URL":"https:\/\/doi.org\/10.1016\/j.cor.2026.107466","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2026,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A dual-agent neighborhood search algorithm for solving hybrid flowshop scheduling problem","name":"articletitle","label":"Article Title"},{"value":"Computers & Operations Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.cor.2026.107466","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":"107466"}}