返回
A data-driven simulation-optimization framework for generating priority dispatching rules in dynamic job shop scheduling with uncertainties
DOI:10.1016/j.jmsy.2023.08.001.png)
摘要
En 中文
Modeling and optimizing dynamic job shop scheduling problems (DJSSP) without ample assumptions is inherently challenging due to the increasing complexity and uncertainty arising from various disruptive events. Moreover, establishing job due dates in dynamic job shop environments has become increasing difficult due to unforeseen events, while it remains a pivotal factor in determining tardiness-related objectives. A research gap exists in exploring the potential synergy between the two aforementioned aspects and its resulting implications. In this study, we propose a novel framework that combines data-driven simulation, machine learning, and evolutionary algorithm to generate new Priority Dispatching Rules (PDRs) for optimizing makespan and total tardiness. The framework incorporates a data-exchange mechanism for real-time updates of the simulation model based on the shop floor. Moreover, an online due date prediction model using XGBoost is developed, replacing the previous rough estimation of the Total Work Content (TWK) rule. Simulation experiments of various scales demonstrate that XGBoost-assisted due date prediction leads to an average reduction of 1.6% in makespan and 65.0% in total tardiness compared to the TWK rule. The proposed method outperforms existing well-known dispatching rules, yielding considerable improvements with average reductions of 90.8%, 40.3%, and 44.6% in total tardiness for vary-sized experiments. Finally, the approach is validated through a real industrial case study.
Keyword:
Dynamic job shop scheduling
Data-driven simulation and optimization
Priority dispatching rules generation
Machine learning & evolutionary algorithm
期刊
IF:
14.2
论文数:
2.7K
被引数:
1.6W
机构
引用论文
Simulation-based experimental design and statistical modeling for lead time quotation基于仿真的提前期报价实验设计与统计建模
Edge computing-based real-time scheduling for digital twin flexible job shop with variable time window基于边缘计算的可变时间窗数字孪生柔性作业车间实时调度
A comparison of priority rules for the job shop scheduling problem under different flow time- and tardiness-related objective functions在不同的流程时间和迟到相关目标函数下,作业车间调度问题的优先级规则的比较
Digital Twin Shop-Floor: A New Shop-Floor Paradigm Towards Smart Manufacturing数字孪生车间: 面向智能制造的新车间范式
IEEE ACCESS
IF3.6
Agent-based simulation and optimization of hybrid flow shop considering multi-skilled workers and fatigue factors考虑多技术工人和乏力因素的基于Agent的混合流水车间仿真与优化

