Two-stage Intelligent Dynamic Scheduling Framework for Re-entrant Blocking Flow Shops with Central Buffer

IF 2.8 Q3 ENGINEERING, MANUFACTURING
Manufacturing Letters Pub Date : 2026-10-01 Epub Date: 2026-10-05 DOI:10.1016/j.mfglet.2026.07.029
Donghai Wang, Jing Zou, Xinan Zhou, Yang Xiang, Ziyun Huang, Sun Jin
{"title":"Two-stage Intelligent Dynamic Scheduling Framework for Re-entrant Blocking Flow Shops with Central Buffer","authors":"Donghai Wang,&nbsp;Jing Zou,&nbsp;Xinan Zhou,&nbsp;Yang Xiang,&nbsp;Ziyun Huang,&nbsp;Sun Jin","doi":"10.1016/j.mfglet.2026.07.029","DOIUrl":null,"url":null,"abstract":"<div><div>Re-entrant blocking flow shops are commonly encountered in modern discrete manufacturing processes, where jobs revisit stations and blocking occurs without intermediate buffers. To improve efficiency and minimize makespan, this study proposes a two-stage intelligent dynamic scheduling framework for re-entrant blocking flow shops with a central buffer. A system-level disjunctive graph is constructed to model interactions among operations, machines, and the buffer, and the scheduling problem is reformulated as a two-stage Markov Decision Process. A hybrid Graph Neural Network – Long Short Term Memory Network is developed to encode spatial–temporal features, while a hierarchical policy alternates between operation–resource selection and job assignment. Experimental results across multiple cases show that the proposed method clearly outperforms representative heuristic rules, achieving an average makespan improvement of 8%. Moreover, it attains solution quality comparable to genetic algorithm optimization with extended computation time while maintaining millisecond-level inference latency. These results demonstrate the framework’s effectiveness, scalability, and real-time applicability for intelligent scheduling in complex manufacturing environments.</div></div>","PeriodicalId":38186,"journal":{"name":"Manufacturing Letters","volume":"49 ","pages":"Pages 195-203"},"PeriodicalIF":2.8000,"publicationDate":"2026-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Manufacturing Letters","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2213846326000805","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2026/10/5 0:00:00","PubModel":"Epub","JCR":"Q3","JCRName":"ENGINEERING, MANUFACTURING","Score":null,"Total":0}
引用次数: 0

Abstract

Re-entrant blocking flow shops are commonly encountered in modern discrete manufacturing processes, where jobs revisit stations and blocking occurs without intermediate buffers. To improve efficiency and minimize makespan, this study proposes a two-stage intelligent dynamic scheduling framework for re-entrant blocking flow shops with a central buffer. A system-level disjunctive graph is constructed to model interactions among operations, machines, and the buffer, and the scheduling problem is reformulated as a two-stage Markov Decision Process. A hybrid Graph Neural Network – Long Short Term Memory Network is developed to encode spatial–temporal features, while a hierarchical policy alternates between operation–resource selection and job assignment. Experimental results across multiple cases show that the proposed method clearly outperforms representative heuristic rules, achieving an average makespan improvement of 8%. Moreover, it attains solution quality comparable to genetic algorithm optimization with extended computation time while maintaining millisecond-level inference latency. These results demonstrate the framework’s effectiveness, scalability, and real-time applicability for intelligent scheduling in complex manufacturing environments.
具有中心缓冲区的可重入阻塞流车间的两阶段智能动态调度框架
可重入阻塞流车间通常在现代离散制造过程中遇到,其中工作重访站和阻塞发生时没有中间缓冲区。为了提高效率和最小化完工时间,本文提出了一种具有中心缓冲区的可重入阻塞流车间的两阶段智能动态调度框架。构建了系统级析取图来模拟操作、机器和缓冲区之间的交互,并将调度问题重新表述为两阶段马尔可夫决策过程。提出了一种混合图神经网络-长短期记忆网络对时空特征进行编码,同时在操作资源选择和任务分配之间进行分层策略交替。多个案例的实验结果表明,该方法明显优于代表性启发式规则,平均完工时间提高了8%。此外,它在保持毫秒级推理延迟的同时,获得了与遗传算法优化相当的解决方案质量。这些结果表明,该框架在复杂制造环境下的智能调度具有有效性、可扩展性和实时性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Manufacturing Letters
Manufacturing Letters Engineering-Industrial and Manufacturing Engineering
CiteScore
4.20
自引率
5.10%
发文量
192
审稿时长
60 days
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书