Some heuristics for no-wait flowshops with total tardiness criterion

No-wait flowshop scheduling problem is widely investigated because of its practical application and specific properties. However, the total tardiness criterion has not been much considered. In this paper, we propose six heuristic approaches for no-wait flowshops with total tardiness criterion, among...

Full description

Saved in:
Bibliographic Details
Published inComputers & operations research Vol. 40; no. 2; pp. 521 - 525
Main Authors Liu, Gengcheng, Song, Shiji, Wu, Cheng
Format Journal Article
LanguageEnglish
Published Kidlington Elsevier Ltd 01.02.2013
Elsevier
Pergamon Press Inc
Subjects
Algorithms
Applied sciences
Computation
Criteria
Dealing
Exact sciences and technology
Heuristic
Job shops
No-wait flowshop
Operational research and scientific management
Operational research. Management science
Operations research
Optimization algorithms
Performance evaluation
Production scheduling
Scheduling
Scheduling, sequencing
Studies
Total tardiness
Total tardiness
No-wait flowshop
Heuristic
Heuristic method
Flow shop
Scheduling
Delay
Online AccessGet full text

Cover

More Information
Summary:No-wait flowshop scheduling problem is widely investigated because of its practical application and specific properties. However, the total tardiness criterion has not been much considered. In this paper, we propose six heuristic approaches for no-wait flowshops with total tardiness criterion, among which the modified NEH algorithm (MNEH) is verified to be the best. Also, a speed-up technique is introduced to MNEH to reduce the computational time in certain cases. By numeral experiments and analysis, we evaluate the performances of various heuristics. Finally we find out that MNEH is a satisfactory algorithm dealing with this problem.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0305-0548
1873-765X
0305-0548
DOI:10.1016/j.cor.2012.07.019