A hybrid algorithm for the single-machine total tardiness problem

Edwin Tai Chiu Cheng, A. A. Lazarev, E. R. Gafarov

Research output: Journal article publicationJournal articleAcademic researchpeer-review

12 Citations (Scopus)


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.
Original languageEnglish
Pages (from-to)308-315
Number of pages8
JournalComputers and Operations Research
Issue number2
Publication statusPublished - 1 Feb 2009


  • Meta-heuristics
  • Scheduling

ASJC Scopus subject areas

  • Information Systems and Management
  • Management Science and Operations Research
  • Applied Mathematics
  • Modelling and Simulation
  • Transportation

Cite this