An ant colony optimization approach for the single machine total tardiness problem

Author

Bauer, Andreas ; Bullnheimer, Bernd ; Hartl, Richard F. ; Strauss, Christine

Author_Institution

Dept. of Manage. Sci., Vienna Univ., Austria

Volume

2

fYear

1999

fDate

1999

Abstract

Machine scheduling is a central task in production planning. In general it means the problem of scheduling job operations on a given number of available machines. We consider a machine scheduling problem with one machine, the Single Machine Total Tardiness Problem. To solve this NP hard problem, we apply the ant colony optimization metaphor, a recently developed meta-heuristic that has proven its potential for various other combinatorial optimization problems. We test our algorithm using 125 benchmark problems and present computational results

Keywords

computational complexity; computer aided production planning; heuristic programming; optimisation; production control; scheduling; NP hard problem; ant colony optimization approach; ant colony optimization metaphor; benchmark problems; combinatorial optimization problems; job operations; machine scheduling; machine scheduling problem; meta-heuristic; production planning; single machine total tardiness problem; Ant colony optimization; Benchmark testing; Dynamic programming; Genetic mutations; Heuristic algorithms; Job design; Lagrangian functions; NP-hard problem; Production planning; Single machine scheduling;

fLanguage

English

Publisher

ieee

Conference_Titel

Evolutionary Computation, 1999. CEC 99. Proceedings of the 1999 Congress on

Conference_Location

Washington, DC

Print_ISBN

0-7803-5536-9

Type

conf

DOI

10.1109/CEC.1999.782653

Filename

782653