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 条
  • [21] Scheduling flexible job shop problem subject to machine breakdown with game theory
    Sun, Di-hua
    He, Wei
    Zheng, Lin-jiang
    Liao, Xiao-yong
    [J]. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2014, 52 (13) : 3858 - 3876
  • [22] A coordinated scheduling problem for the supply chain in a flexible job shop machine environment
    Ceylan, Zeynep
    Tozan, Hakan
    Bulkan, Serol
    [J]. OPERATIONAL RESEARCH, 2021, 21 (02) : 875 - 900
  • [23] A coordinated scheduling problem for the supply chain in a flexible job shop machine environment
    Zeynep Ceylan
    Hakan Tozan
    Serol Bulkan
    [J]. Operational Research, 2021, 21 : 875 - 900
  • [24] Mathematical Models for a Flexible Job Shop Scheduling Problem with Machine Operator Constraints
    Kress, Dominik
    Mueller, David
    [J]. IFAC PAPERSONLINE, 2019, 52 (13): : 94 - 99
  • [25] Makespan optimization in the flexible Job Shop problem with transportation constraints using Genetic Algorithms
    Castillo, T. A.
    Diaz B, C. E.
    Gomez, J. D.
    Orduz, E. A.
    Nino, M. L.
    [J]. ENTRE CIENCIA E INGENIERIA, 2018, (24): : 105 - 115
  • [26] Transgenic Genetic Algorithm to Minimize the Makespan in the Job Shop Scheduling Problem
    Viana, Monique Simplicio
    Morandin Junior, Orides
    Contreras, Rodrigo Colnago
    [J]. ICAART: PROCEEDINGS OF THE 12TH INTERNATIONAL CONFERENCE ON AGENTS AND ARTIFICIAL INTELLIGENCE, VOL 2, 2020, : 463 - 474
  • [27] A hybrid genetic algorithm for job shop scheduling problem to minimize makespan
    Liu, Lin
    Xi, Yugeng
    [J]. WCICA 2006: SIXTH WORLD CONGRESS ON INTELLIGENT CONTROL AND AUTOMATION, VOLS 1-12, CONFERENCE PROCEEDINGS, 2006, : 3709 - +
  • [28] Application of Firefly Algorithm in Job Shop Scheduling Problem for Minimization of Makespan
    Udaiyakumar, K. C.
    Chandrasekaran, M.
    [J]. 12TH GLOBAL CONGRESS ON MANUFACTURING AND MANAGEMENT (GCMM - 2014), 2014, 97 : 1798 - 1807
  • [29] Application of Genetic Programming on Makespan Optimization of Job Shop Scheduling Problem
    Lu Shaohua
    Xia Yun
    [J]. PROCEEDINGS OF THE 6TH INTERNATIONAL CONFERENCE ON INNOVATION AND MANAGEMENT, VOLS I AND II, 2009, : 1284 - 1291
  • [30] Flexible job shop scheduling problem for parallel batch processing machine with compatible job families
    Ham, Andy
    [J]. APPLIED MATHEMATICAL MODELLING, 2017, 45 : 551 - 562