Some heuristics for no-wait flowshops with total tardiness criterion

Authors:
Gengcheng Liu;Shiji Song;Cheng Wu
Affiliations:
Department of Automation, Tsinghua University, Beijing, 100084, PR China;Department of Automation, Tsinghua University, Beijing, 100084, PR China;Department of Automation, Tsinghua University, Beijing, 100084, PR China
Venue:
Computers and Operations Research
Year:
2013

Citing 2
Cited 0

An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem

INFORMS Journal on Computing
A novel differential evolution algorithm for bi-criteria no-wait flow shop scheduling problems

Computers and Operations Research

Quantified Score

Hi-index	0.01

Visualization

Abstract

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.