Flexible open shop scheduling problem to minimize makespan

被引：43

作者：

Bai, Danyu ^{[1
,2
]}

Zhang, Zhi-Hai ^{[2
]}

Zhang, Qiang ^{[3
]}

机构：

[1] Shenyang Univ Chem Technol, Sch Econ & Management, Shenyang 110142, Peoples R China

[2] Tsinghua Univ, Dept Ind Engn, Beijing 100084, Peoples R China

[3] Northeastern Univ, Software Coll, Shenyang 110819, Peoples R China

来源：

COMPUTERS & OPERATIONS RESEARCH | 2016年 / 67卷

基金：

中国国家自然科学基金;

关键词：

Scheduling; Flexible open shop; Makespan; Asymptotic analysis; Differential evolution algorithm; DIFFERENTIAL EVOLUTION ALGORITHM; MULTIPROCESSOR OPEN SHOP; PARALLEL MACHINES; SETUP TIMES;

D O I：

10.1016/j.cor.2015.10.012

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

This study investigates the static and dynamic versions of the flexible open shop scheduling problem with the goal of minimizing makespan. The asymptotic optimality of the general dense scheduling (GDS) algorithm is proven by the boundedness hypothesis. For large-scale problems, the GDS-based heuristic algorithms are presented to accelerate convergence. For moderate-scale problems, the differential evolution algorithm is employed to obtain high-quality solutions. A series of random experiments are conducted to demonstrate the effectiveness of the proposed algorithms. (C) 2015 Elsevier Ltd. All rights reserved.

引用

页码：207 / 215

页数：9

共 50 条

[41] New algorithms and complexity status of the reducibility problem of sequences in open shop scheduling minimizing the makespan
Andresen, Michael
Dhamala, Tanka Nath
ANNALS OF OPERATIONS RESEARCH, 2012, 196 (01) : 1 - 26
[42] New algorithms and complexity status of the reducibility problem of sequences in open shop scheduling minimizing the makespan
Michael Andresen
Tanka Nath Dhamala
Annals of Operations Research, 2012, 196 : 1 - 26
[43] Open shop scheduling to minimize the number of late jobs
Koulamas, C
Kyparisis, GJ
NAVAL RESEARCH LOGISTICS, 1998, 45 (05) : 525 - 532
[44] Minimizing the makespan for the flow shop scheduling problem with availability constraints
Aggoune, R
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2004, 153 (03) : 534 - 543
[45] Evolutionary heuristics and an algorithm for the two-stage assembly scheduling problem to minimize makespan with setup times
Allahverdi, Ali
Al-Anzi, Fawaz S.
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2006, 44 (22) : 4713 - 4735
[46] Scheduling with periodic availability constraints to minimize makespan
Yu, Lishi
Tan, Zhiyi
JOURNAL OF SCHEDULING, 2024, 27 (03) : 277 - 297
[47] Efficiency of the solution representations for the hybrid flow shop scheduling problem with makespan objective
Fernandez-Viagas, Victor
Perez-Gonzalez, Paz
Framinan, Jose M.
COMPUTERS & OPERATIONS RESEARCH, 2019, 109 : 77 - 88
[48] Permutation flow shop scheduling problem to minimize nonlinear objective function with release dates
Bai, Danyu
Liang, Jianheng
Liu, Bingqian
Tang, Mengqian
Zhang, Zhi-Hai
COMPUTERS & INDUSTRIAL ENGINEERING, 2017, 112 : 336 - 347
[49] Heuristic Model for Dynamic Single Machine Group Scheduling in Laser Cutting Job Shop to Minimize the Makespan
Ying, Nyeoh Cheng
Bin Mokhtar, Mohzani
MANUFACTURING SCIENCE AND TECHNOLOGY, PTS 1-8, 2012, 383-390 : 6236 - +
[50] No-wait flowshop scheduling problem with separate setup times to minimize total tardiness subject to makespan
Allahverdi, Ali
Aydilek, Harun
Aydilek, Asiye
APPLIED MATHEMATICS AND COMPUTATION, 2020, 365

← 1 2 3 4 5 →