A dynamical ant colony optimization with heuristics for scheduling jobs on a single machine with a common due date

Zne Jung Lee*, Shih Wei Lin, Kuo Ching Ying

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

2 Scopus citations

Abstract

The problem of scheduling jobs on a single machine with a common due date is one of NP-complete problems. It is to minimize the total earliness and tardiness penalties. This chapter introduces a Dynamical Ant Colony Optimization (DACO) with heuristics for scheduling jobs on a single machine with a common due date. In the proposed algorithm, the parameter of heuristic information is dynamically adjusted. Furthermore, additional heuristics are embedded into DACO as local search to escape from local optima. Compared with other existing approaches in the literature, the proposed algorithm is very useful for scheduling jobs on a single machine with a common due date.

Original languageEnglish
Title of host publicationMetaheuristics for Scheduling in Industrial and Manufacturing Applications
EditorsFatos Xhafa, Ajith Abraham
Pages91-103
Number of pages13
DOIs
StatePublished - 2008
Externally publishedYes

Publication series

NameStudies in Computational Intelligence
Volume128
ISSN (Print)1860-949X

Keywords

  • Dynamical ant colony optimization
  • Heuristics
  • Scheduling
  • Single machine

Fingerprint

Dive into the research topics of 'A dynamical ant colony optimization with heuristics for scheduling jobs on a single machine with a common due date'. Together they form a unique fingerprint.

Cite this