A hybrid algorithm for the single-machine total tardiness problem

Authors:
T. C. E. Cheng;A. A. Lazarev;E. R. Gafarov
Affiliations:
Department of Logistics, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong;Computing Centre of the Russian Academy of Sciences, Vavilov st. 40, 119333 Moscow GSP-1, Russia;Computing Centre of the Russian Academy of Sciences, Vavilov st. 40, 119333 Moscow GSP-1, Russia
Venue:
Computers and Operations Research
Year:
2009

Citing 4
Cited 3

Minimizing total tardiness on one machine is NP-hard

Mathematics of Operations Research
Lower Bounds on the Approximation Ratios of Leading Heuristics for the Single-Machine Total Tardiness Problem

Journal of Scheduling
A decomposition algorithm for the single machine total tardiness problem

Operations Research Letters
On decomposition of the total tardiness problem

Operations Research Letters

An ant colony optimization algorithm for setup coordination in a two-stage production system

Applied Soft Computing
A theoretical development for the total tardiness problem and its application in branch and bound algorithms

Computers and Operations Research
Literature review regarding Ant Colony Optimization applied to scheduling problems: Guidelines for implementation and directions for future research

Engineering Applications of Artificial Intelligence

Quantified Score

Hi-index	0.01

Visualization

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.