Applying ant colony optimization to solve the single machine total tardiness problem

Autor(en)

Andreas Bauer, Bernd Bullnheimer, Richard Hartl, Christine Strauss

Abstrakt

Ant Colony Optimization is a relatively new meta-heuristic that has proven its quality and versatility on various combinatorial optimization problems such as the traveling salesman problem, the vehicle routing problem and the job shop scheduling problem. The paper introduces an Ant Colony Optimization approach to solve the problem of determining a job-sequence that minimizes the overall tardiness for a given set of jobs to be processed on a single, continuously available machine, the Single Machine Total Tardiness Problem. We experiment with various heuristic information as well as with variants for local search. Experiments with 250 benchmark problems with 50 and 100 jobs illustrate that Ant Colony Optimization is an adequate method to tackle the SMTTP. (author's abstract)

Organisation(en)

Institut für Rechnungswesen, Innovation und Strategie

Band

42

Anzahl der Seiten

14

Publikationsdatum

1999

ÖFOS 2012

101015 Operations Research, 502052 Betriebswirtschaftslehre, 502017 Logistik, 502050 Wirtschaftsinformatik

Link zum Portal

https://ucrisportal.univie.ac.at/de/publications/bc5fb774-f4cc-41e5-b79a-fa89a6e488b4