The flexible job shop scheduling problem: A review

被引：92

作者：

Dauzere-Peres, Stephane ^{[1
,2
]}

Ding, Junwen ^{[3
]}

Shen, Liji ^{[4
]}

Tamssaouet, Karim ^{[2
]}

机构：

[1] Univ Clermont Auvergne, Mines St Etienne, CNRS, UMR 6158,LIMOS, Gardanne, France

[2] BI Norwegian Business Sch, Dept Accounting & Operat Management, Oslo, Norway

[3] Huazhong Univ Sci & Technol, Sch Comp Sci & Technol, Wuhan, Peoples R China

[4] WHU Otto Beisheim Sch Management, Vallendar, Germany

来源：

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 2024年 / 314卷 / 02期

关键词：

Scheduling; Flexible job shop; Survey; Criteria; Constraints; SEQUENCE-DEPENDENT SETUP; SHIFTING BOTTLENECK PROCEDURE; PARTICLE SWARM OPTIMIZATION; HARMONY SEARCH ALGORITHM; TOTAL WEIGHTED TARDINESS; BEE COLONY ALGORITHM; GENETIC ALGORITHM; TABU-SEARCH; TRANSPORTATION TIMES; INTEGRATED APPROACH;

D O I：

10.1016/j.ejor.2023.05.017

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

The flexible job shop scheduling problem (FJSP) is an NP-hard combinatorial optimization problem, which has wide applications in the real world. The complexity and relevance of the FJSP have led to numer-ous research works on its modeling and resolution. This paper reviews some of the research of the past 30 years on the problem, by presenting and classifying the different criteria, constraints, configurations and solution approaches that have been considered. Recent emerging topics on complex shop schedul-ing, multi-criteria optimization and uncertain and dynamic environments are discussed. Finally, future research opportunities are proposed. (c) 2023 Elsevier B.V. All rights reserved.

引用

页码：409 / 432

页数：24

共 221 条

[1] A neighborhood search function for flexible job shop scheduling with separable sequence-dependent setup times [J].

Abdelmaguid, Tamer F. .

APPLIED MATHEMATICS AND COMPUTATION, 2015, 260 :188-203

[2] THE SHIFTING BOTTLENECK PROCEDURE FOR JOB SHOP SCHEDULING [J].

ADAMS, J ;

BALAS, E ;

ZAWACK, D .

MANAGEMENT SCIENCE, 1988, 34 (03) :391-401

[3] A multi objective optimization approach for flexible job shop scheduling problem under random machine breakdown by evolutionary algorithms [J].

Ahmadi, Ehsan ;

Zandieh, Mostafa ;

Farrokh, Mojtaba ;

Emami, Seyed Mohammad .

COMPUTERS & OPERATIONS RESEARCH, 2016, 73 :56-66

[4] Robust and stable flexible job shop scheduling with random machine breakdowns using a hybrid genetic algorithm [J].

Al-Hinai, Nasr ;

ElMekkawy, T. Y. .

INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2011, 132 (02) :279-291

[5] An efficient Pareto approach for solving the multi-objective flexible job-shop scheduling problem with regular criteria [J].

Alberto Garcia-Leon, Andres ;

Dauzere-Peres, Stephane ;

Mati, Yazid .

COMPUTERS & OPERATIONS RESEARCH, 2019, 108 :187-200

[6] The third comprehensive survey on scheduling problems with setup times/costs [J].

Allahverdi, Ali .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2015, 246 (02) :345-378

[7] A heuristic to schedule flexible job-shop in a glass factory [J].

Alvarez-Valdes, R ;

Fuertes, A ;

Tamarit, JM ;

Giménez, G ;

Ramos, R .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2005, 165 (02) :525-534

[8] Scheduling a dual-resource flexible job shop with makespan and due date-related criteria [J].

Andrade-Pineda, Jose L. ;

Canca, David ;

Gonzalez-R, Pedro L. ;

Calle, M. .

ANNALS OF OPERATIONS RESEARCH, 2020, 291 (1-2) :5-35

[9]

[Anonymous], 1996, Flexible job shop scheduling by tabu search, graduate program in operations research and industrial engineering

[10] Accelerated simulated annealing algorithm applied to the flexible job shop scheduling problem [J].

Antonio Cruz-Chavez, Marco ;

Martinez-Rangel, Martin G. ;

Cruz-Rosales, Martin H. .

INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 2017, 24 (05) :1119-1137

← 1 2 3 4 5 6 7 8 9 10 →