Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/651
Title: A hybrid algorithm for the single-machine total tardiness problem
Authors: Cheng, TCE 
Lazarev, AA
Gafarov, ER
Keywords: Scheduling
Meta-heuristics
Issue Date: Feb-2009
Publisher: Elsevier Ltd.
Source: Computers & operations research, Feb. 2009, v. 36, no. 2, p. 308-315 How to cite?
Journal: Computers & operations research 
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.
URI: http://hdl.handle.net/10397/651
ISSN: 0305-0548
DOI: 10.1016/j.cor.2007.10.002
Rights: Computers & Operations Research © 2007 Elsevier Ltd. The journal web site is located at http://www.sciencedirect.com.
Appears in Collections:Journal/Magazine Article

Files in This Item:
File Description SizeFormat 
CLGF.pdfPre-published version408.71 kBAdobe PDFView/Open
Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

12
Last Week
1
Last month
0
Citations as of Jun 5, 2016

WEB OF SCIENCETM
Citations

8
Last Week
0
Last month
0
Citations as of Sep 27, 2016

Page view(s)

363
Last Week
0
Last month
Checked on Sep 25, 2016

Download(s)

341
Checked on Sep 25, 2016

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.