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 |
Issue Date: | Feb-2009 | Source: | Computers and 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. | Keywords: | Scheduling Meta-heuristics |
Publisher: | Pergamon Press | Journal: | Computers and operations research | ISSN: | 0305-0548 | EISSN: | 1873-765X | 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 | Size | Format | |
---|---|---|---|---|
CLGF.pdf | Pre-published version | 408.71 kB | Adobe PDF | View/Open |
Page views
129
Last Week
2
2
Last month
Citations as of Mar 24, 2024
Downloads
206
Citations as of Mar 24, 2024
SCOPUSTM
Citations
15
Last Week
0
0
Last month
0
0
Citations as of Mar 28, 2024
WEB OF SCIENCETM
Citations
11
Last Week
0
0
Last month
0
0
Citations as of Mar 28, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.