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

被引:18
作者
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
相关论文
共 48 条
[1]  
[Anonymous], 2013, IBM ILOG CPLEX optimization studio
[2]   Learning and adaptation of a policy for dynamic order acceptance in make-to-order manufacturing [J].
Arredondo, Facundo ;
Martinez, Ernesto .
COMPUTERS & INDUSTRIAL ENGINEERING, 2010, 58 (01) :70-83
[3]   Machine Learning for industrial applications: A comprehensive literature review [J].
Bertolini, Massimo ;
Mezzogori, Davide ;
Neroni, Mattia ;
Zammori, Francesco .
EXPERT SYSTEMS WITH APPLICATIONS, 2021, 175
[4]   The job shop scheduling problem: Conventional and new solution techniques [J].
Blazewicz, J ;
Domschke, W ;
Pesch, E .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1996, 93 (01) :1-33
[5]  
Brandimarte P., 1993, Annals of Operations Research, V41, P157, DOI 10.1007/BF02023073
[6]   Random forests [J].
Breiman, L .
MACHINE LEARNING, 2001, 45 (01) :5-32
[7]   Production planning and order acceptance in business to business electronic commerce [J].
Calosso, T ;
Cantamessa, M ;
Vu, D ;
Villa, A .
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2003, 85 (02) :233-249
[8]  
Casazza Marco., 2019, HEURISTIC DATA DRIVE, P115
[9]   A self-learning genetic algorithm based on reinforcement learning for flexible job-shop scheduling problem [J].
Chen, Ronghua ;
Yang, Bo ;
Li, Shi ;
Wang, Shilong .
COMPUTERS & INDUSTRIAL ENGINEERING, 2020, 149
[10]   Real-time order acceptance and scheduling for data-enabled permutation flow shops: Bilevel interactive optimization with nonlinear integer programming [J].
Chen, Wenchong ;
Gong, Xuejian ;
Rahman, Humyun Fuad ;
Liu, Hongwei ;
Qi, Ershi .
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2021, 105