A service provided by the WU Library and the WU IT-Services

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

Bauer, Andreas and Bullnheimer, Bernd and Hartl, Richard F. and Strauß, Christine (1999) Applying ant colony optimization to solve the single machine total tardiness problem. Report Series SFB "Adaptive Information Systems and Modelling in Economics and Management Science", 42. SFB Adaptive Information Systems and Modelling in Economics and Management Science, WU Vienna University of Economics and Business, Vienna.

[img]
Preview
PDF
Download (286Kb) | Preview

Abstract

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)

Item Type: Paper
Keywords: ant colony methods / machine scheduling / meta-heuristic
Divisions: Departments > Finance, Accounting and Statistics > Statistics and Mathematics
Departments > Informationsverarbeitung u Prozessmanag. > Informationswirtschaft
Departments > Informationsverarbeitung u Prozessmanag. > Produktionsmanagement > Taudes
Departments > Marketing > Service Marketing und Tourismus
Depositing User: Repository Administrator
Date Deposited: 08 Mar 2002 11:11
Last Modified: 05 May 2015 21:27
URI: http://epub.wu.ac.at/id/eprint/1368

Actions

View Item