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 条
  • [31] Virtual Machine Scheduling for Parallel Soft Real-Time Applications
    Zhou, Like
    Wu, Song
    Sun, Huahua
    Jin, Hai
    Shi, Xuanhua
    2013 IEEE 21ST INTERNATIONAL SYMPOSIUM ON MODELING, ANALYSIS & SIMULATION OF COMPUTER AND TELECOMMUNICATION SYSTEMS (MASCOTS 2013), 2013, : 525 - 534
  • [32] THE INVERSE PARALLEL MACHINE SCHEDULING PROBLEM WITH MINIMUM TOTAL COMPLETION TIME
    Hongtruong Pham
    Lu, Xiwen
    JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION, 2014, 10 (02) : 613 - 620
  • [33] Parallel Machine Scheduling Problem With Order Sharing and Time Value of Money
    Zhi, Rongteng
    Xu, Yinfeng
    PROCEEDINGS OF THE 2019 INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND SYSTEMS MANAGEMENT (IESM 2019), 2019, : 112 - 117
  • [34] A Probabilistic Machine Learning Approach to Scheduling Parallel Loops With Bayesian Optimization
    Kim, Khu-rai
    Kim, Youngjae
    Park, Sungyong
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2021, 32 (07) : 1815 - 1827
  • [35] A MACHINE FOR VIDEO REAL-TIME IMAGE-PROCESSING USING PARALLEL POLYMORPHISM
    PIERRE, F
    HERVE, Y
    EUGENE, R
    DRAMAN, C
    WENDLING, S
    CA-DSP 89, VOLS 1 AND 2: 1989 INTERNATIONAL SYMPOSIUM ON COMPUTER ARCHITECTURE AND DIGITAL SIGNAL PROCESSING, 1989, : 584 - 589
  • [36] Parallel machine scheduling problem to minimize the makespan with resource dependent processing times
    Li, Kai
    Shi, Ye
    Yang, Shan-lin
    Cheng, Ba-yi
    APPLIED SOFT COMPUTING, 2011, 11 (08) : 5551 - 5557
  • [37] Real-time Wind Direction Estimation using Machine Learning on Operational Wind Farm Data
    Karami, Farzad
    Zhang, Yujie
    Rotea, Mario A.
    Bernardoni, Federico
    Leonardi, Stefano
    2021 60TH IEEE CONFERENCE ON DECISION AND CONTROL (CDC), 2021, : 2456 - 2461
  • [38] Unrelated parallel machine scheduling problem with special controllable processing times and setups
    Wang, Shijin
    Wu, Ruochen
    Chu, Feng
    Yu, Jianbo
    COMPUTERS & OPERATIONS RESEARCH, 2022, 148
  • [39] Memetic algorithm for unrelated parallel machine scheduling problem with grey processing times
    Arik, Oguzhan Ahmet
    JOURNAL OF MODELLING IN MANAGEMENT, 2023, 18 (05) : 1584 - 1602
  • [40] A COMBINATION OF PARALLEL MACHINE SCHEDULING AND THE COVERING PROBLEM
    Wang, Zhenbo
    Hong, Wenyi
    He, Dong
    PACIFIC JOURNAL OF OPTIMIZATION, 2014, 10 (03): : 577 - 591