Estimation of processing time using machine learning and real factory data for optimization of parallel machine scheduling problem

被引:19
|
作者
Yamashiro, Hirochika [1 ]
Nonaka, Hirofumi [1 ]
机构
[1] Nagaoka Univ Technol, Nagaoka, Niigata, Japan
来源
关键词
Machine learning; Gaussian process regression; Gradient boosted decision trees; Artificial neural networks; Identical parallel machine scheduling; Operations research; ARTIFICIAL NEURAL-NETWORK; ALGORITHM; MAKESPAN; CONSUMPTION; PREDICTION; FRAMEWORK; FLOWSHOP;
D O I
10.1016/j.orp.2021.100196
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
Traditionally, mathematical optimization methods have been applied in manufacturing industries where production scheduling is one of the most important problems and is being actively researched. Extant studies assume that processing times are known or follow a simple distribution. However, the actual processing time in a factory is often unknown and likely follows a complex distribution. Therefore, in this study, we consider estimating the processing time using a machine-learning model. Although there are studies that use machine learning for scheduling optimization itself, it should be noted that the purpose of this study is to estimate an unknown processing time. Using machine-learning models, one can estimate processing times that follow an unknown and complex distribution while further improving the schedule using the computed importance variable. Based on the above, we propose a system for estimating the processing time using machine-learning models when the processing time follows a complex distribution in actual factory data. The advantages of the proposed system are its versatility and applicability to a real-world factory where the processing times are often unknown. The proposed method was evaluated using process information with the processing time for each manufacturing sample provided by research partner companies. The Light gradient-boosted machine (LightGBM) algorithm and Ridge performed the best with MAPE and RMSE. The optimization of parallel machine scheduling using estimated processing time by our method resulted in an average reduction of approximately 30% for the makespan. On the other hands, the results of probabilistic sampling methods which are Kernel Density Estimation, Gamma distribution, and Normal Distribution have shown poorer performance than ML approaches. In addition, machine-learning models can be used to deduce variables that affect the estimation of processing times, and in this study, we demonstrated an example of feature importance computed from experimental data. In addition, machine-learning models can be used to deduce variables that affect the estimation of processing times, and in this study, we demonstrated an example of feature importance computed from experimental data.
引用
收藏
页数:9
相关论文
共 50 条
  • [1] Robust optimization for identical parallel machine scheduling with uncertain processing time
    Seo, Kwang-Kyu
    Do Chung, Byung
    JOURNAL OF ADVANCED MECHANICAL DESIGN SYSTEMS AND MANUFACTURING, 2014, 8 (02):
  • [2] On a parallel machine scheduling problem with equal processing times
    Kravchenko, Svedana A.
    Werner, Frank
    DISCRETE APPLIED MATHEMATICS, 2009, 157 (04) : 848 - 852
  • [3] Particle Swarm Optimization for Parallel Machine Scheduling Problem with Machine Eligibility Constraints
    Hao Jinghua
    Liu Min
    Wu Cheng
    CHINESE JOURNAL OF ELECTRONICS, 2010, 19 (01): : 103 - 106
  • [4] Parallel machine scheduling with time dependent processing times
    Chen, ZL
    DISCRETE APPLIED MATHEMATICS, 1996, 70 (01) : 81 - 93
  • [5] LR&CG algorithm for parallel machine real-time scheduling problem
    Wang, Gong-Shu
    Tang, Li-Xin
    Kongzhi yu Juece/Control and Decision, 2013, 28 (06): : 829 - 836
  • [6] Unrelated Parallel Machine Scheduling with Job Splitting, Setup Time, Learning Effect, Processing Cost and Machine Eligibility
    Zheng, Feifeng
    Jin, Kaiyuan
    Xu, Yinfeng
    Liu, Ming
    ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 2023, 40 (03)
  • [7] A robust optimization approach for the unrelated parallel machine scheduling problem
    De La Vega, Jonathan
    Moreno, Alfredo
    Morabito, Reinaldo
    Munari, Pedro
    TOP, 2023, 31 (01) : 31 - 66
  • [8] A robust optimization approach for the unrelated parallel machine scheduling problem
    Jonathan De La Vega
    Alfredo Moreno
    Reinaldo Morabito
    Pedro Munari
    TOP, 2023, 31 : 31 - 66
  • [9] Unrelated parallel machine scheduling with machine processing cost
    Safarzadeha, Hamid
    Niakia, Seyed Taghi Akhavan
    INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING COMPUTATIONS, 2022, : 33 - 48
  • [10] Unrelated parallel-machine scheduling with controllable processing time
    Hsu, Chia-Lun
    Taur, Jin-Shiuh
    MECHATRONICS AND INDUSTRIAL INFORMATICS, PTS 1-4, 2013, 321-324 : 1993 - +