{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,26]],"date-time":"2026-05-26T16:03:01Z","timestamp":1779811381598,"version":"3.53.1"},"reference-count":35,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"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":["Engineering Applications of Artificial Intelligence"],"published-print":{"date-parts":[[2026,8]]},"DOI":"10.1016\/j.engappai.2026.115073","type":"journal-article","created":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T16:09:38Z","timestamp":1778602178000},"page":"115073","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"P1","title":["Buffer-adaptive hierarchical deep reinforcement learning for multi-line Hybrid Flow Shop Scheduling with Limited Buffers"],"prefix":"10.1016","volume":"178","author":[{"given":"Zhanwen","family":"Wu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Weihang","family":"Dong","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Feng","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhaolong","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jinxin","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/j.engappai.2026.115073_b1","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1287\/opre.48.1.177.12451","article-title":"Minimizing cycle time in a blocking flowshop","volume":"48","author":"Abadi","year":"2000","journal-title":"Oper. Res."},{"key":"10.1016\/j.engappai.2026.115073_b2","doi-asserted-by":"crossref","DOI":"10.1016\/j.engappai.2021.104196","article-title":"Two efficient nature inspired meta-heuristics solving blocking hybrid flow shop manufacturing problem","volume":"100","author":"Aqil","year":"2021","journal-title":"Eng. Appl. Artif. Intell."},{"key":"10.1016\/j.engappai.2026.115073_b3","doi-asserted-by":"crossref","DOI":"10.1016\/j.swevo.2023.101399","article-title":"A collaborative iterated greedy algorithm with reinforcement learning for energy-aware distributed blocking flow-shop scheduling","volume":"83","author":"Bao","year":"2023","journal-title":"Swarm Evol. Comput."},{"key":"10.1016\/j.engappai.2026.115073_b4","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2023.122744","article-title":"Deadlock control and hybrid social spider scheduling algorithm for two-stage assembly permutation flowshop with limited buffers","volume":"245","author":"Cao","year":"2024","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.engappai.2026.115073_b5","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2026.111989","article-title":"A review of artificial intelligence impacting statistical process monitoring and future directions","volume":"216","author":"Chang","year":"2026","journal-title":"Comput. Ind. Eng."},{"issue":"2","key":"10.1016\/j.engappai.2026.115073_b6","doi-asserted-by":"crossref","first-page":"571","DOI":"10.1080\/0305215X.2024.2328191","article-title":"Scheduling optimization of flexible flow shop with buffer capacity limitation based on an improved discrete particle swarm optimization algorithm","volume":"57","author":"Chang","year":"2024","journal-title":"Eng. Optim."},{"key":"10.1016\/j.engappai.2026.115073_b7","doi-asserted-by":"crossref","DOI":"10.1016\/j.apenergy.2024.123130","article-title":"Neural network-based surrogate modeling and optimization of a multigeneration system","volume":"364","author":"Ghafariasl","year":"2024","journal-title":"Appl. Energy"},{"key":"10.1016\/j.engappai.2026.115073_b8","article-title":"A learning-guided multi-objective approach for energy-oriented hybrid flow shop scheduling with limited buffers","author":"He","year":"2025","journal-title":"Inform. Sci."},{"key":"10.1016\/j.engappai.2026.115073_b9","doi-asserted-by":"crossref","first-page":"34477","DOI":"10.1109\/ACCESS.2019.2904848","article-title":"Energy-oriented scheduling for hybrid flow shop with limited buffers through efficient multi-objective optimization","volume":"7","author":"Jiang","year":"2019","journal-title":"IEEE Access"},{"issue":"4","key":"10.1016\/j.engappai.2026.115073_b10","doi-asserted-by":"crossref","first-page":"6550","DOI":"10.1109\/TASE.2023.3327792","article-title":"Double DQN-based coevolution for green distributed heterogeneous hybrid flowshop scheduling with multiple priorities of jobs","volume":"21","author":"Li","year":"2024","journal-title":"IEEE Trans. Autom. Sci. Eng."},{"key":"10.1016\/j.engappai.2026.115073_b11","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1016\/j.ins.2014.10.009","article-title":"Solving the large-scale hybrid flow shop scheduling problem with limited buffers by a hybrid artificial bee colony algorithm","volume":"316","author":"Li","year":"2015","journal-title":"Inform. Sci."},{"key":"10.1016\/j.engappai.2026.115073_b12","doi-asserted-by":"crossref","DOI":"10.1016\/j.knosys.2025.113424","article-title":"Q-learning-driven accelerated iterated greedy algorithm for multi-scenario group scheduling in distributed blocking flowshops","volume":"317","author":"Li","year":"2025","journal-title":"Knowl.-Based Syst."},{"key":"10.1016\/j.engappai.2026.115073_b13","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2019.106154","article-title":"Considering stockers in reentrant hybrid flow shop scheduling with limited buffer capacity","volume":"139","author":"Lin","year":"2020","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.engappai.2026.115073_b14","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2024.109995","article-title":"Reentrant hybrid flow shop scheduling with stockers in automated material handling systems using deep reinforcement learning","volume":"189","author":"Lin","year":"2024","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.engappai.2026.115073_b15","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.engappai.2026.115073_b16","doi-asserted-by":"crossref","DOI":"10.1016\/j.knosys.2025.113633","article-title":"Deep reinforcement learning for job shop scheduling problems: A comprehensive literature review","volume":"321","author":"Lv","year":"2025","journal-title":"Knowl.-Based Syst."},{"key":"10.1016\/j.engappai.2026.115073_b17","doi-asserted-by":"crossref","DOI":"10.1016\/j.engappai.2025.113214","article-title":"An improved DeepLab version three plus algorithm for segmenting heartwood and sapwood on wooden flooring surface","volume":"164","author":"Meng","year":"2026","journal-title":"Eng. Appl. Artif. Intell."},{"issue":"4","key":"10.1016\/j.engappai.2026.115073_b18","doi-asserted-by":"crossref","first-page":"1843","DOI":"10.1007\/s10845-017-1358-7","article-title":"An evolutionary clustering search for the total tardiness blocking flow shop problem","volume":"30","author":"Nagano","year":"2017","journal-title":"J. Intell. Manuf."},{"key":"10.1016\/j.engappai.2026.115073_b19","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1016\/j.cie.2015.04.013","article-title":"Efficient heuristic algorithms for the blocking flow shop scheduling problem with total flow time minimization","volume":"87","author":"Ribas","year":"2015","journal-title":"Comput. Ind. Eng."},{"issue":"7","key":"10.1016\/j.engappai.2026.115073_b20","doi-asserted-by":"crossref","first-page":"651","DOI":"10.1057\/jors.1987.108","article-title":"Multilevel scheduling of multistage production with limited in-process inventory","volume":"38","author":"Sawik","year":"1987","journal-title":"J. Oper. Res. Soc."},{"key":"10.1016\/j.engappai.2026.115073_b21","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1016\/j.eng.2024.11.033","article-title":"Deep reinforcement learning-based multi-objective scheduling for distributed heterogeneous hybrid flow shops with blocking constraints","volume":"46","author":"Sun","year":"2025","journal-title":"Engineering"},{"key":"10.1016\/j.engappai.2026.115073_b22","doi-asserted-by":"crossref","first-page":"990","DOI":"10.1016\/j.jmsy.2024.10.018","article-title":"An improved non-dominated sorting genetic algorithm II for distributed heterogeneous hybrid flow-shop scheduling with blocking constraints","volume":"77","author":"Sun","year":"2024","journal-title":"J. Manuf. Syst."},{"issue":"3","key":"10.1016\/j.engappai.2026.115073_b23","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1057\/palgrave.jors.2602033","article-title":"Lagrangian relaxation algorithms for real-time hybrid flowshop scheduling with finite intermediate buffers","volume":"57","author":"Tang","year":"2006","journal-title":"J. Oper. Res. Soc."},{"issue":"2","key":"10.1016\/j.engappai.2026.115073_b24","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1016\/j.ejor.2025.08.002","article-title":"A hybrid population-based ruin-and-recreate algorithm for the blocking flow shop scheduling problem","volume":"329","author":"Teixeira","year":"2026","journal-title":"European J. Oper. Res."},{"issue":"3","key":"10.1016\/j.engappai.2026.115073_b25","doi-asserted-by":"crossref","first-page":"793","DOI":"10.1080\/00207543.2014.933273","article-title":"A Pareto block-based estimation and distribution algorithm for multi-objective permutation flow shop scheduling problem","volume":"53","author":"Tiwari","year":"2014","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/j.engappai.2026.115073_b26","doi-asserted-by":"crossref","DOI":"10.1016\/j.swevo.2025.102155","article-title":"DAFSP with limited assembly buffers: A deadlock-free coding-decoding paradigm and hybrid cooperative co-evolutionary approach","volume":"99","author":"Wang","year":"2025","journal-title":"Swarm Evol. Comput."},{"key":"10.1016\/j.engappai.2026.115073_b27","doi-asserted-by":"crossref","DOI":"10.1016\/j.rcim.2024.102918","article-title":"Integrated optimization of storage space allocation and crane scheduling in automated storage and retrieval systems","volume":"93","author":"Zhang","year":"2025","journal-title":"Robot. Comput.-Integr. Manuf."},{"key":"10.1016\/j.engappai.2026.115073_b28","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","volume":"300","author":"Zhang","year":"2026","journal-title":"Expert Syst. Appl."},{"issue":"11","key":"10.1016\/j.engappai.2026.115073_b29","doi-asserted-by":"crossref","first-page":"12112","DOI":"10.1109\/TCYB.2021.3081805","article-title":"A hybrid artificial immune-simulated annealing algorithm for multiroute job shop scheduling problem with continuous limited output buffers","volume":"52","author":"Zhang","year":"2022","journal-title":"IEEE Trans. Cybern."},{"key":"10.1016\/j.engappai.2026.115073_b30","doi-asserted-by":"crossref","DOI":"10.1016\/j.rcim.2020.102081","article-title":"A discrete whale swarm algorithm for hybrid flow-shop scheduling problem with limited buffers","volume":"68","author":"Zhang","year":"2021","journal-title":"Robot. Comput.-Integr. Manuf."},{"issue":"11","key":"10.1016\/j.engappai.2026.115073_b31","doi-asserted-by":"crossref","first-page":"6822","DOI":"10.1109\/TSMC.2021.3102658","article-title":"Dual-space co-evolutionary memetic algorithm for scheduling hybrid differentiation flowshop with limited buffer constraints","volume":"52","author":"Zhang","year":"2022","journal-title":"IEEE Trans. Syst. Man Cybern.: Syst."},{"key":"10.1016\/j.engappai.2026.115073_b32","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/j.cor.2019.04.002","article-title":"Differential evolution metaheuristics for distributed limited-buffer flowshop scheduling with makespan criterion","volume":"108","author":"Zhang","year":"2019","journal-title":"Comput. Oper. Res."},{"issue":"5","key":"10.1016\/j.engappai.2026.115073_b33","doi-asserted-by":"crossref","first-page":"3337","DOI":"10.1109\/TCYB.2022.3192112","article-title":"A hyperheuristic with Q-learning for the multiobjective energy-efficient distributed blocking flow shop scheduling problem","volume":"53","author":"Zhao","year":"2023","journal-title":"IEEE Trans. Cybern."},{"issue":"1","key":"10.1016\/j.engappai.2026.115073_b34","doi-asserted-by":"crossref","first-page":"781","DOI":"10.1007\/s40747-023-01147-8","article-title":"A cooperative adaptive genetic algorithm for reentrant hybrid flow shop scheduling with sequence-dependent setup time and limited buffers","volume":"10","author":"Zheng","year":"2023","journal-title":"Complex Intell. Syst."},{"key":"10.1016\/j.engappai.2026.115073_b35","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2025.107078","article-title":"Scheduling optimization for laminated door machining shop based on improved genetic algorithm","volume":"180","author":"Zhou","year":"2025","journal-title":"Comput. Oper. Res."}],"container-title":["Engineering Applications of Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0952197626013564?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0952197626013564?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,5,26]],"date-time":"2026-05-26T15:07:57Z","timestamp":1779808077000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0952197626013564"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8]]},"references-count":35,"alternative-id":["S0952197626013564"],"URL":"https:\/\/doi.org\/10.1016\/j.engappai.2026.115073","relation":{},"ISSN":["0952-1976"],"issn-type":[{"value":"0952-1976","type":"print"}],"subject":[],"published":{"date-parts":[[2026,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Buffer-adaptive hierarchical deep reinforcement learning for multi-line Hybrid Flow Shop Scheduling with Limited Buffers","name":"articletitle","label":"Article Title"},{"value":"Engineering Applications of Artificial Intelligence","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.engappai.2026.115073","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":"115073"}}