Data-Driven Dispatching Rules Mining and Real-Time Decision-Making Methodology in Intelligent Manufacturing Shop Floor with Uncertainty

被引:9
作者
Zhang, Liping [1 ,2 ]
Hu, Yifan [1 ,2 ]
Tang, Qiuhua [1 ,2 ]
Li, Jie [3 ]
Li, Zhixiong [4 ,5 ]
机构
[1] Wuhan Univ Sci & Technol, Minist Educ, Key Lab Met Equipment & Control Technol, Wuhan 430081, Peoples R China
[2] Wuhan Univ Sci & Technol, Hubei Key Lab Mech Transmiss & Mfg Engn, Wuhan 430081, Peoples R China
[3] Univ Manchester, Ctr Proc Integrat, Dept Chem Engn & Analyt Sci, Manchester M13 9PL, Lancs, England
[4] Yonsei Univ, Yonsei Frontier Lab, 50 Yonsei Ro, Seoul 03722, South Korea
[5] Opole Univ Technol, Fac Mech Engn, 76 Proszkowska St, PL-45758 Opole, Poland
基金
中国国家自然科学基金; 英国工程与自然科学研究理事会;
关键词
data-driven; machine learning; dispatching rules; offline training; online decision-making; DYNAMIC JOB-SHOP; ALGORITHM; SEARCH;
D O I
10.3390/s21144836
中图分类号
O65 [分析化学];
学科分类号
070302 ; 081704 ;
摘要
In modern manufacturing industry, the methods supporting real-time decision-making are the urgent requirement to response the uncertainty and complexity in intelligent production process. In this paper, a novel closed-loop scheduling framework is proposed to achieve real-time decision making by calling the appropriate data-driven dispatching rules at each rescheduling point. This framework contains four parts: offline training, online decision-making, data base and rules base. In the offline training part, the potential and appropriate dispatching rules with managers' expectations are explored successfully by an improved gene expression program (IGEP) from the historical production data, not just the available or predictable information of the shop floor. In the online decision-making part, the intelligent shop floor will implement the scheduling scheme which is scheduled by the appropriate dispatching rules from rules base and store the production data into the data base. This approach is evaluated in a scenario of the intelligent job shop with random jobs arrival. Numerical experiments demonstrate that the proposed method outperformed the existing well-known single and combination dispatching rules or the discovered dispatching rules via metaheuristic algorithm in term of makespan, total flow time and tardiness.
引用
收藏
页数:23
相关论文
共 53 条
[11]   Real-time production planning and control system for job-shop manufacturing: A system dynamics analysis [J].
Georgiadis, Patroklos ;
Michaloudis, Charalampos .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2012, 216 (01) :94-104
[12]   A Simple Multi-Objective Optimization Based on the Cross-Entropy Method [J].
Haber, Rodolfo E. ;
Beruvides, Gerardo ;
Quiza, Ramon ;
Hernandez, Alejandro .
IEEE ACCESS, 2017, 5 :22272-22281
[13]  
HAUPT R, 1989, OR SPEKTRUM, V11, P3
[14]   Dispatching rule selection with Gaussian processes [J].
Heger, Jens ;
Hildebrandt, Torsten ;
Scholz-Reiter, Bernd .
CENTRAL EUROPEAN JOURNAL OF OPERATIONS RESEARCH, 2015, 23 (01) :235-249
[15]  
Ho NB, 2005, IEEE C EVOL COMPUTAT, P2848
[16]   Efficient dispatching rules for scheduling in a job shop [J].
Holthaus, O ;
Rajendran, C .
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 1997, 48 (01) :87-105
[17]   Evolving priority scheduling heuristics with genetic programming [J].
Jakobovic, Domagoj ;
Marasovic, Kristina .
APPLIED SOFT COMPUTING, 2012, 12 (09) :2781-2789
[18]   Learning dispatching rules for single machine scheduling with dynamic arrivals based on decision trees and feature construction [J].
Jun, Sungbum ;
Lee, Seokcheon .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2021, 59 (09) :2838-2856
[19]   An evolutionary simulation-based optimization approach for dispatching scheduling [J].
Korytkowski, Przemyslaw ;
Wisniewski, Tomasz ;
Rymaszewski, Szymon .
SIMULATION MODELLING PRACTICE AND THEORY, 2013, 35 :69-85
[20]   Routing-based reactive scheduling policies for machine failures in dynamic job shops [J].
Kutanoglu, E ;
Sabuncuoglu, I .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2001, 39 (14) :3141-3158