Predicting makespan in Flexible Job Shop Scheduling Problem using Machine Learning

被引:4
|
作者
Tremblet, David [1 ]
Thevenin, Simon [1 ]
Dolgui, Alexandre [1 ]
机构
[1] IMT Atlantique, LS2N CNRS, 4 Rue Alfred Kastler,BP 20722, F-44307 Nantes, France
来源
IFAC PAPERSONLINE | 2022年 / 55卷 / 10期
基金
欧盟地平线“2020”;
关键词
Production planning and scheduling; Artificial Intelligence; OPTIMIZATION;
D O I
10.1016/j.ifacol.2022.09.305
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Machine learning tools have experienced a growing interest in the early 2010s, providing efficient predictive approaches for artificial intelligence and statistical analysis. These same prediction methods have also sparked interest in the operations research community for decision-making based on predictive analysis by exploiting massive histories and datasets. This study investigates the potential of machine learning tools to predict the feasibility of a production plan. Production schedules are often not able to adhere to the production plans because production plans are built without accounting for all the detailed requirements that arise at the scheduling level. We show that predicting the feasibility of a production plan with a decision tree yields a precision of around 90% versus 70% in the classical capacity constraints considered in planning tools. Copyright (C) 2022 The Authors.
引用
收藏
页码:1 / 6
页数:6
相关论文
共 50 条
  • [1] Makespan estimation in a flexible job-shop scheduling environment using machine learning
    Tremblet, David
    Thevenin, Simon
    Dolgui, Alexandre
    [J]. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2024, 62 (10) : 3654 - 3670
  • [2] Minimizing the makespan and carbon emissions in the green flexible job shop scheduling problem with learning effects
    Li, Zhi
    Chen, Yingjian
    [J]. SCIENTIFIC REPORTS, 2023, 13 (01)
  • [3] Minimizing the makespan and carbon emissions in the green flexible job shop scheduling problem with learning effects
    Zhi Li
    Yingjian Chen
    [J]. Scientific Reports, 13
  • [4] Efficient Genetic Algorithm for Flexible Job-Shop Scheduling Problem Using Minimise Makespan
    Farashahi, Hamid Ghaani
    Baharudini, B. T. H. T.
    Shojaeipour, Shahed
    Jaberi, Mohammad
    [J]. INTELLIGENT COMPUTING AND INFORMATION SCIENCE, PT II, 2011, 135 : 385 - +
  • [5] Predicting the Solution Time for Optimization Problems Using Machine Learning Case of Job Shop Scheduling Problem
    Pouya, Shaheen
    Toragay, Oguz
    Mohammadi, Mehrdad
    [J]. OPTIMIZATION, LEARNING ALGORITHMS AND APPLICATIONS, PT I, OL2A 2023, 2024, 1981 : 450 - 465
  • [6] Maximizing the service level on the makespan in the stochastic flexible job-shop scheduling problem
    Flores-Gomez, Mario
    Borodin, Valeria
    Dauzere-Peres, Stephane
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2023, 157
  • [7] Flexible open shop scheduling problem to minimize makespan
    Bai, Danyu
    Zhang, Zhi-Hai
    Zhang, Qiang
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2016, 67 : 207 - 215
  • [8] Two-Machine Job-Shop Scheduling Problem to Minimize the Makespan with Uncertain Job Durations
    Sotskov, Yuri N.
    Matsveichuk, Natalja M.
    Hatsura, Vadzim D.
    [J]. ALGORITHMS, 2020, 13 (01)
  • [9] Solving the Flexible Job Shop Scheduling Problem With Makespan Optimization by Using a Hybrid Taguchi-Genetic Algorithm
    Chang, Hao-Chin
    Chen, Yeh-Peng
    Liu, Tung-Kuan
    Chou, Jyh-Horng
    [J]. IEEE ACCESS, 2015, 3 : 1740 - 1754
  • [10] FLEXIBLE JOB SHOP SCHEDULING PROBLEM WITH PARALLEL BATCH PROCESSING MACHINE
    Ham, Andy
    [J]. 2016 WINTER SIMULATION CONFERENCE (WSC), 2016, : 2740 - 2749