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 条
  • [31] Genetic algorithm for the flexible job-shop scheduling problem
    Kacem, I
    [J]. 2003 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN AND CYBERNETICS, VOLS 1-5, CONFERENCE PROCEEDINGS, 2003, : 3464 - 3469
  • [32] A Hybrid EA for Reactive Flexible Job-shop Scheduling
    Lin, Lin
    Gen, Mitsuo
    Liang, Yan
    Ohno, Katsuhisa
    [J]. COMPLEX ADAPTIVE SYSTEMS 2012, 2012, 12 : 110 - 115
  • [33] A Hybrid Algorithm for Flexible Job-shop Scheduling Problem
    Tang, Jianchao
    Zhang, Guoji
    Lin, Binbin
    Zhang, Bixi
    [J]. CEIS 2011, 2011, 15
  • [34] Flexible job-shop scheduling problems with 'AND'/'OR' precedence constraints
    Lee, Sanghyup
    Moon, Ilkyeong
    Bae, Hyerim
    Kim, Jion
    [J]. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2012, 50 (07) : 1979 - 2001
  • [35] A Flexible Job-shop Scheduling for Small Batch Customizing
    Li, Hu
    Li, Zhe
    Yang, Ruiduan
    Lu, Huawei
    Zhang, Youchao
    [J]. PROCEEDINGS OF THE 28TH CHINESE CONTROL AND DECISION CONFERENCE (2016 CCDC), 2016, : 2197 - 2201
  • [36] Flexible Job-Shop Scheduling Problem by Genetic Algorithm
    Ida, Kenichi
    Oka, Kensaku
    [J]. ELECTRICAL ENGINEERING IN JAPAN, 2011, 177 (03) : 28 - 35
  • [37] Flexible Job-Shop Scheduling with Setups and Variable Sublots
    Yan, Ge
    Wang Aimin
    Zhao Zijin
    [J]. PROCEEDINGS OF 2020 IEEE 11TH INTERNATIONAL CONFERENCE ON MECHANICAL AND INTELLIGENT MANUFACTURING TECHNOLOGIES (ICMIMT 2020), 2020, : 187 - 192
  • [38] Benchmarking flexible job-shop scheduling and control systems
    Trentesaux, Damien
    Pach, Cyrille
    Bekrar, Abdelghani
    Sallez, Yves
    Berger, Thierry
    Bonte, Therese
    Leitao, Paulo
    Barbosa, Jose
    [J]. CONTROL ENGINEERING PRACTICE, 2013, 21 (09) : 1204 - 1225
  • [39] Production scheduling of job-shop type flexible manufacturing
    Mohamed, Nahed S.
    Abdin, M.F.
    El Sabbagh, A.S.
    [J]. Robotics and Factories of the Future - Proceedings of an International Conference, 1984,
  • [40] Research on Flexible Job-shop Scheduling Problems with Integrated Reinforcement Learning Algorithm
    Zhang K.
    Bi L.
    Jiao X.
    [J]. Zhongguo Jixie Gongcheng/China Mechanical Engineering, 2023, 34 (02): : 201 - 207