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

Autor(en)

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

Abstrakt

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.

Organisation(en)

Institut für Rechnungswesen, Innovation und Strategie, Institut für Business Decisions and Analytics

Externe Organisation(en)

Universität Wien

Seiten

1445-1450

Anzahl der Seiten

6

DOI

https://doi.org/10.1109/CEC.1999.782653

Publikationsdatum

1999

Peer-reviewed

Ja

ÖFOS 2012

502052 Betriebswirtschaftslehre, 101015 Operations Research

ASJC Scopus Sachgebiete

Computational Mathematics

Link zum Portal

https://ucris.univie.ac.at/portal/de/publications/an-ant-colony-optimization-approach-for-the-single-machine-total-tardiness-problem(1f3b1e5c-cbe4-4574-b299-fd10028a8f60).html