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 条

[31] Metaheuristics for minimizing the makespan of the dynamic shop scheduling problem
Liu, SQ
Ong, HL
Ng, KM
ADVANCES IN ENGINEERING SOFTWARE, 2005, 36 (03) : 199 - 205
[32] Efficient Genetic Algorithm for Flexible Job-Shop Scheduling Problem Using Minimise Makespan
Farashahi, Hamid Ghaani
Baharudini, B. T. H. T.
Shojaeipour, Shahed
Jaberi, Mohammad
INTELLIGENT COMPUTING AND INFORMATION SCIENCE, PT II, 2011, 135 : 385 - +
[33] Scheduling Three-Operation Jobs in a Two-Machine Flow Shop to Minimize Makespan
Jatinder N.D. Gupta
Christos P. Koulamas
George J. Kyparisis
Chris N. Potts
Vitaly A. Strusevich
Annals of Operations Research, 2004, 129 : 171 - 185
[34] General variable neighborhood search algorithm to minimize makespan of the distributed no-wait flow shop scheduling problem
Komaki M.
Malakooti B.
Production Engineering, 2017, 11 (3) : 315 - 329
[35] Flow shop scheduling to minimize makespan with decreasing time-dependent job processing times
Wang, Xiao-Yuan
Wang, Ming-Zheng
Wang, Ji-Bo
COMPUTERS & INDUSTRIAL ENGINEERING, 2011, 60 (04) : 840 - 844
[36] A simulated annealing for hybrid flow shop scheduling with multiprocessor tasks to minimize makespan
Wang, Hui-Mei
Chou, Fuh-Der
Wu, Ful-Chiang
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2011, 53 (5-8) : 761 - 776
[37] A simulated annealing for hybrid flow shop scheduling with multiprocessor tasks to minimize makespan
Hui-Mei Wang
Fuh-Der Chou
Ful-Chiang Wu
The International Journal of Advanced Manufacturing Technology, 2011, 53 : 761 - 776
[38] The Open Shop Scheduling Problem
Woeginger, Gerhard J.
35TH SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2018), 2018, 96
[39] Hybrid Flow Shop Scheduling With Learning Effects and Release Dates to Minimize the Makespan
Wang, Xinyue
Ren, Tao
Bai, Danyu
Chu, Feng
Lu, Xinyu
Weng, Zedong
Li, Jiang
Liang, Jie
IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS, 2024, 54 (01): : 365 - 378
[40] Scheduling three-operation jobs in a two-machine flow shop to minimize makespan
Gupta, JND
Koulamas, CP
Kyparisis, GJ
Potts, CN
Strusevich, VA
ANNALS OF OPERATIONS RESEARCH, 2004, 129 (1-4) : 171 - 185

← 1 2 3 4 5 →