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.
Originalsprache | Englisch |
---|---|
Seiten | 1445-1450 |
Seitenumfang | 6 |
DOIs | |
Publikationsstatus | Veröffentlicht - 1999 |
Veranstaltung | 1999 Congress on Evolutionary Computation, CEC 1999 - Washington, DC, USA / Vereinigte Staaten Dauer: 6 Juli 1999 → 9 Juli 1999 |
Konferenz
Konferenz | 1999 Congress on Evolutionary Computation, CEC 1999 |
---|---|
Land/Gebiet | USA / Vereinigte Staaten |
Ort | Washington, DC |
Zeitraum | 6/07/99 → 9/07/99 |
ÖFOS 2012
- 502052 Betriebswirtschaftslehre
- 101015 Operations Research