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 , Matthias Thürer , Shaohua He , Ting Qu , Lin Ma , 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.
期刊介绍:
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.