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

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

Veröffentlichungen: Beitrag zu KonferenzPaperPeer Reviewed

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.

OriginalspracheEnglisch
Seiten1445-1450
Seitenumfang6
DOIs
PublikationsstatusVeröffentlicht - 1999
Veranstaltung1999 Congress on Evolutionary Computation, CEC 1999 - Washington, DC, USA / Vereinigte Staaten
Dauer: 6 Juli 19999 Juli 1999

Konferenz

Konferenz1999 Congress on Evolutionary Computation, CEC 1999
Land/GebietUSA / Vereinigte Staaten
OrtWashington, DC
Zeitraum6/07/999/07/99

ÖFOS 2012

  • 502052 Betriebswirtschaftslehre
  • 101015 Operations Research

Zitationsweisen