An effective heuristic for no-wait flow shop production to minimize makespan

被引：20

作者：

Ye, Honghan ^{[1
]}

Li, Wei ^{[1
]}

Miao, Enming ^{[2
]}

机构：

[1] Univ Kentucky, Lexington, KY 40506 USA

[2] Hefei Univ Technol, Hefei, Peoples R China

来源：

JOURNAL OF MANUFACTURING SYSTEMS | 2016年 / 40卷

关键词：

Makespan minimization; No-wait flow shop; Heuristics; Computational complexity; TARDINESS MINIMIZATION; SCHEDULING PROBLEMS; SEQUENCING PROBLEM; FLOWSHOPS; ALGORITHMS; MACHINE;

D O I：

10.1016/j.jmsy.2016.05.001

中图分类号：

T [工业技术];

学科分类号：

08 ;

摘要：

In no-wait flow shop production, each job must be processed without any interruption from its start time on the first machine to its completion time on the last machine. To minimize makespan in no-wait flow shop production is one of the main concerns in industry. In this paper, we propose an average departure time (ADT) heuristic for minimizing makespan in no-wait flow shop production. Based on the computational experiment with a large number of instances of various sizes, the ADT heuristic performs better than three existing best-known heuristics in the same computational complexity environment. (C) 2016 The Society of Manufacturing Engineers. Published by Elsevier Ltd. All rights reserved.

引用

页码：2 / 7

页数：6

共 50 条

[21] An improved heuristic to minimize total flow time for scheduling in the m-machine no-wait flow shop
Laha, Dipak
Sapkal, Sagar U.
COMPUTERS & INDUSTRIAL ENGINEERING, 2014, 67 : 36 - 43
[22] Heuristic algorithm for scheduling in the no-wait flow-shop
Bertolissi, E
JOURNAL OF MATERIALS PROCESSING TECHNOLOGY, 2000, 107 (1-3) : 459 - 465
[23] New heuristics for no-wait flowshops to minimize makespan
Aldowaisan, T
Allahverdi, A
COMPUTERS & OPERATIONS RESEARCH, 2003, 30 (08) : 1219 - 1231
[24] Makespan minimization in a no-wait flow shop problem with two batching machines
Oulamara, Ammar
COMPUTERS & OPERATIONS RESEARCH, 2007, 34 (04) : 1033 - 1050
[25] A Genetic Algorithm Applied Heuristic to Minimize the Makespan in a Flow Shop
Pugazhenthi, R.
Xavior, Anthony M.
12TH GLOBAL CONGRESS ON MANUFACTURING AND MANAGEMENT (GCMM - 2014), 2014, 97 : 1735 - 1744
[26] Hybrid evolutionary algorithm for no-wait flow shops to minimize makespan and total flowtime
Liao, Xiaoping
Liu, Yougen
Li, Xiaoping
Journal of Southeast University (English Edition), 2008, 24 (04) : 450 - 454
[27] Fast tabu search algorithm for no-wait flow shop problem with makespan criterion
Grabowski, J
Pempera, J
8TH WORLD MULTI-CONFERENCE ON SYSTEMICS, CYBERNETICS AND INFORMATICS, VOL V, PROCEEDINGS: COMPUTER SCIENCE AND ENGINEERING, 2004, : 333 - 338
[28] An improved NEH heuristic to minimize makespan for flow shop scheduling problems
Sharma, Meenakshi
Sharma, Manisha
Sharma, Sameer
DECISION SCIENCE LETTERS, 2021, 10 (03) : 311 - 322
[29] A new heuristic for minimal makespan in no-wait hybrid flowshops
Chang, Junlin
Ma, Guangfu
Ma, Xiaoping
2006 CHINESE CONTROL CONFERENCE, VOLS 1-5, 2006, : 395 - +
[30] The no-wait flow shop with rejection
Koulamas, Christos
Kyparisis, George J.
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2021, 59 (06) : 1852 - 1859

← 1 2 3 4 5 →