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

被引:11
|
作者
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 条
  • [21] A general efficient neighborhood structure framework for the job-shop and flexible job-shop scheduling problems
    Tamssaouet, Karim
    Dauzere-Peres, Stephane
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2023, 311 (02) : 455 - 471
  • [22] Energy efficiency, robustness, and makespan optimality in job-shop scheduling problems
    Salido, Miguel A.
    Escamilla, Joan
    Barber, Federico
    Giret, Adriana
    Tang, Dunbing
    Dai, Min
    AI EDAM-ARTIFICIAL INTELLIGENCE FOR ENGINEERING DESIGN ANALYSIS AND MANUFACTURING, 2016, 30 (03): : 300 - 312
  • [23] Dynamic job-shop scheduling using reinforcement learning agents
    Aydin, ME
    Öztemel, E
    ROBOTICS AND AUTONOMOUS SYSTEMS, 2000, 33 (2-3) : 169 - 178
  • [24] JOB-SHOP SCHEDULING
    NEW, C
    DATA PROCESSING, 1974, 16 (02): : 100 - 102
  • [25] A Study of Flexible Job-Shop Scheduling with Dual Constraints
    Gao, Zhenhua
    Qiao, Hengyun
    PROCESSES, 2024, 12 (12)
  • [26] A Genetic Algorithm for the Flexible Job-Shop Scheduling Problem
    Wang, Jin Feng
    Du, Bi Qiang
    Ding, Hai Min
    ADVANCED RESEARCH ON COMPUTER SCIENCE AND INFORMATION ENGINEERING, PT I, 2011, 152 : 332 - 339
  • [27] Scheduling for the Flexible Job-Shop Problem with a Dynamic Number of Machines Using Deep Reinforcement Learning
    Chang, Yu-Hung
    Liu, Chien-Hung
    You, Shingchern D.
    INFORMATION, 2024, 15 (02)
  • [28] Research on Strategy of Dynamic Flexible Job-shop Scheduling
    Pan, Ying
    Xue, Dongjuan
    Gao, Tianyi
    Zhou, Libin
    Xie, Xiaoyu
    APPLIED MATERIALS AND TECHNOLOGIES FOR MODERN MANUFACTURING, PTS 1-4, 2013, 423-426 : 2237 - +
  • [29] A genetic algorithm for the Flexible Job-shop Scheduling Problem
    Pezzella, F.
    Morganti, G.
    Ciaschetti, G.
    COMPUTERS & OPERATIONS RESEARCH, 2008, 35 (10) : 3202 - 3212
  • [30] A Hybrid EA for Reactive Flexible Job-shop Scheduling
    Lin, Lin
    Gen, Mitsuo
    Liang, Yan
    Ohno, Katsuhisa
    COMPLEX ADAPTIVE SYSTEMS 2012, 2012, 12 : 110 - 115