Makespan estimation in a flexible job-shop scheduling environment using machine learning

被引:7
|
作者
Tremblet, David [1 ,2 ]
Thevenin, Simon [1 ]
Dolgui, Alexandre [1 ]
机构
[1] IMT Atlantique, CNRS, LS2N, Nantes, France
[2] IMT Atlantique, CNRS, LS2N, 4 Rue Alfred Kastler,BP 20722, F-44307 Nantes, France
基金
欧盟地平线“2020”;
关键词
Scheduling; production planning; machine learning; make to order production; flexible job shop; ORDER ACCEPTANCE; DISPATCHING RULES; METAHEURISTICS; TIME;
D O I
10.1080/00207543.2023.2245918
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
A production plan gives the quantity of products to release on the shop floor in each period, where a period may represent a week or a month. The plan is the basis for negotiating order acceptance and delivery dates with customers and suppliers. The production plan must respect the available capacity on the shop floor, as underloading the shop floor leads to a loss of opportunity, and thus, a loss of competitiveness for the company. To properly manage the production capacity while negotiating with suppliers and customers, the production planners need a tool to accurately estimate the capacity consumption in each period. The computation of capacity consumption requires creating a detailed production schedule which is a complex task. Algorithms that find close to optimal schedules in a complex manufacturing environment are often time-consuming, which is impractical in a negotiation context. We investigate machine learning models to predict capacity consumption. We consider a flexible job-shop as commonly encountered in practice, and proposed several machine learning models. Namely, several variants of linear regression, decision trees, and artificial neural networks. Numerical experiments showed that our models outperform those found by both an exact approach and dispatching rules when computation time is short.
引用
收藏
页码:3654 / 3670
页数:17
相关论文
共 50 条
  • [1] Predicting makespan in Flexible Job Shop Scheduling Problem using Machine Learning
    Tremblet, David
    Thevenin, Simon
    Dolgui, Alexandre
    [J]. IFAC PAPERSONLINE, 2022, 55 (10): : 1 - 6
  • [2] 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 - +
  • [3] FLEXIBLE JOB-SHOP SCHEDULING WITH OVERLAPPING MACHINE SETS
    Zhang, Tao
    Xie, Shufang
    Rose, Oliver
    [J]. 2015 WINTER SIMULATION CONFERENCE (WSC), 2015, : 2307 - 2316
  • [4] 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
  • [5] EVOLUTION BASED LEARNING IN A JOB-SHOP SCHEDULING ENVIRONMENT
    DORNDORF, U
    PESCH, E
    [J]. COMPUTERS & OPERATIONS RESEARCH, 1995, 22 (01) : 25 - 40
  • [6] 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)
  • [7] An Estimation of Distribution Algorithm for the Flexible Job-Shop Scheduling Problem
    Wang, Shengyao
    Wang, Ling
    Zhou, Gang
    Xu, Ye
    [J]. ADVANCED INTELLIGENT COMPUTING THEORIES AND APPLICATIONS: WITH ASPECTS OF ARTIFICIAL INTELLIGENCE, 2012, 6839 : 9 - 16
  • [8] Machine learning and evolutionary optimization approach for solving the flexible job-shop scheduling problem
    Guo, Hong
    Yang, Jin
    Yang, Jun
    [J]. Journal of Intelligent and Fuzzy Systems, 2024, 46 (04): : 8845 - 8863
  • [9] DSS FOR JOB-SHOP MACHINE SCHEDULING
    JACOBS, LW
    LAUER, J
    [J]. INDUSTRIAL MANAGEMENT & DATA SYSTEMS, 1994, 94 (04) : 15 - 23
  • [10] An efficient architecture for scheduling flexible job-shop with machine availability constraints
    E. Moradi
    S. M. T. Fatemi Ghomi
    M. Zandieh
    [J]. The International Journal of Advanced Manufacturing Technology, 2010, 51 : 325 - 339