Scheduling features selection enhanced dispatching decision for dynamic job shop scheduling: a knowledge and data-based approach

IF 4.3 2区 工程技术 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS
Lei Liu , Matthias Thürer , Shaohua He , Ting Qu , Lin Ma , Zhongfei Zhang
{"title":"Scheduling features selection enhanced dispatching decision for dynamic job shop scheduling: a knowledge and data-based approach","authors":"Lei Liu ,&nbsp;Matthias Thürer ,&nbsp;Shaohua He ,&nbsp;Ting Qu ,&nbsp;Lin Ma ,&nbsp;Zhongfei Zhang","doi":"10.1016/j.cor.2025.107299","DOIUrl":null,"url":null,"abstract":"<div><div>Production systems for customizable products are characterized by operational dynamics due to complicated job routings and machine failures, resulting in dynamic job shop scheduling problems. Dispatching rules are the most commonly used and effective solution approaches for dynamic job shop scheduling problems in practice, but individual rules can only provide short-sight solutions. Hence, adaptively choosing the right dispatching rule according to production system status of job shops is required. To improve the accuracy and robustness of data-driven dispatching rule decision, this paper first introduces a knowledge and data based dynamic job shop scheduling framework consisting of scheduling examples generation, knowledge-guided scheduling features selection and data-driven dispatching rule decision. Then a novel knowledge-guided estimation of distribution algorithm (KEDA) is proposed for the scheduling features selection to enhance the performance of the data-driven dispatching rule decision approaches, where KEDA adopts three types of knowledge-guided improvement strategies, namely mutual information guided population initialization, evolutionary fitness guided probability model update for offspring generation and feature selection ratio guided variable neighborhood search. Comprehensive experiments based on real-life job shop scenarios demonstrate the feasibility of the proposed approach framework and the superiority of KEDA over competitive algorithms for scheduling features selection problems.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"186 ","pages":"Article 107299"},"PeriodicalIF":4.3000,"publicationDate":"2025-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computers & Operations Research","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0305054825003284","RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

Abstract

Production systems for customizable products are characterized by operational dynamics due to complicated job routings and machine failures, resulting in dynamic job shop scheduling problems. Dispatching rules are the most commonly used and effective solution approaches for dynamic job shop scheduling problems in practice, but individual rules can only provide short-sight solutions. Hence, adaptively choosing the right dispatching rule according to production system status of job shops is required. To improve the accuracy and robustness of data-driven dispatching rule decision, this paper first introduces a knowledge and data based dynamic job shop scheduling framework consisting of scheduling examples generation, knowledge-guided scheduling features selection and data-driven dispatching rule decision. Then a novel knowledge-guided estimation of distribution algorithm (KEDA) is proposed for the scheduling features selection to enhance the performance of the data-driven dispatching rule decision approaches, where KEDA adopts three types of knowledge-guided improvement strategies, namely mutual information guided population initialization, evolutionary fitness guided probability model update for offspring generation and feature selection ratio guided variable neighborhood search. Comprehensive experiments based on real-life job shop scenarios demonstrate the feasibility of the proposed approach framework and the superiority of KEDA over competitive algorithms for scheduling features selection problems.
动态作业车间调度的调度特征选择增强调度决策:基于知识和数据的方法
由于复杂的作业路线和机器故障,可定制产品的生产系统具有运行动态性的特点,从而导致动态作业车间调度问题。调度规则是实践中动态作业车间调度问题最常用、最有效的求解方法,但单个的调度规则只能提供短期的解决方案。因此,需要根据作业车间的生产系统状态自适应地选择合适的调度规则。为了提高数据驱动调度规则决策的准确性和鲁棒性,本文首先引入了一种基于知识和数据的作业车间动态调度框架,包括调度示例生成、知识引导的调度特征选择和数据驱动的调度规则决策。为了提高数据驱动调度规则决策方法的性能,提出了一种新的知识引导分布估计算法(KEDA)用于调度特征选择,其中KEDA采用了互信息引导的种群初始化、进化适应度引导的后代生成概率模型更新和特征选择比引导的变量邻域搜索三种知识引导的改进策略。基于实际作业车间场景的综合实验证明了所提出的方法框架的可行性,以及KEDA在调度特征选择问题上优于竞争算法的优越性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Computers & Operations Research
Computers & Operations Research 工程技术-工程:工业
CiteScore
8.60
自引率
8.70%
发文量
292
审稿时长
8.5 months
期刊介绍: Operations research and computers meet in a large number of scientific fields, many of which are of vital current concern to our troubled society. These include, among others, ecology, transportation, safety, reliability, urban planning, economics, inventory control, investment strategy and logistics (including reverse logistics). Computers & Operations Research provides an international forum for the application of computers and operations research techniques to problems in these and related fields.
×
引用
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学术官方微信