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

by: A Bauer, B Bullnheimer, RF Hartl, C Strauss

Evolutionary Computation, 1999. CEC 99. Proceedings of the 1999 Congress on, Vol. 2 (1999)

View FullText article

DOI, IEEE Explore

Reviews [Write a review of this article]

There are no reviews of this article

Find related articles from these CiteULike users

lop, pverstra

Find related articles with these CiteULike tags

2006, aco, scheduling, smtwtp

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

@inproceedings{citeulike:921341, 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}, author = {Bauer, A. and Bullnheimer, B. and Hartl, R. F. and Strauss, C. }, citeulike-article-id = {921341}, doi = {10.1109/CEC.1999.782653}, journal = {Evolutionary Computation, 1999. CEC 99. Proceedings of the 1999 Congress on}, keywords = {aco}, pages = {1450 Vol. 2}, posted-at = {2008-04-24 15:40:39}, priority = {2}, title = {An ant colony optimization approach for the single machine total tardiness problem}, url = {http://dx.doi.org/10.1109/CEC.1999.782653}, volume = {2}, year = {1999} }

RIS record

TY - CONF ID - citeulike:921341 L3 - citeulike-article-id:921341 TI - An ant colony optimization approach for the single machine total tardiness problem JF - Evolutionary Computation, 1999. CEC 99. Proceedings of the 1999 Congress on VL - 2 EP - 1450 Vol. 2 N2 - 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 KW - aco AU - Bauer, A AU - Bullnheimer, B AU - Hartl, RF AU - Strauss, C PY - 1999/// UR - http://dx.doi.org/10.1109/CEC.1999.782653 ER -

RIS BibTeX