Please use this identifier to cite or link to this item:
Title: A hybrid algorithm for the single-machine total tardiness problem
Authors: Cheng, T. C. Edwin
Lazarev, A. A.
Gafarov, E. R.
Subjects: Scheduling
Issue Date: Feb-2009
Publisher: Elsevier Ltd.
Source: Computers & operations research, Feb. 2009, v. 36, no. 2, p. 308-315.
Abstract: We propose a hybrid algorithm based on the ant colony optimization (ACO) meta-heuristic, in conjunction with four well-known elimination rules, to tackle the NP-hard single-machine scheduling problem to minimize the total job tardiness. The hybrid algorithm has the same running time as that of ACO. We conducted extensive computational experiments to test the performance of the hybrid algorithm and ACO. The computational results show that the hybrid algorithm can produce optimal or near-optimal solutions quickly, and its performance compares favourably with that of ACO for handling standard instances of the problem.
Rights: Computers & Operations Research © 2007 Elsevier Ltd. The journal web site is located at
Type: Journal/Magazine Article
DOI: 10.1016/j.cor.2007.10.002
ISSN: 0305-0548
Appears in Collections:LMS Journal/Magazine Articles

Files in This Item:
File Description SizeFormat 
CLGF.pdfPre-published version408.71 kBAdobe PDFView/Open

All items in the PolyU Institutional Repository are protected by copyright, with all rights reserved, unless otherwise indicated. No item in the PolyU IR may be reproduced for commercial or resale purposes.