A new approach to solve permutation scheduling problems with ant colony optimization

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2037, Issue , 2001, Pages 484-494

  Merkle, Daniel ^a   Middendorf, Martin ^a  

^a UNIVERSITY OF KARLSRUHE   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ANT COLONY OPTIMIZATION; ARTIFICIAL INTELLIGENCE; OPTIMIZATION; SCHEDULING; SCHEDULING ALGORITHMS;

ANT ALGORITHMS; LIST SCHEDULING HEURISTICS; NEW APPROACHES; PRECEDENCE CONSTRAINTS; SCHEDULING PROBLEM; SINGLE- MACHINES;

PROBLEM SOLVING;

EID: 84958047331     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45365-2_50     Document Type: Conference Paper

References (13)

1. A. Colorni, M. Dorigo, V. Maniezzo, and M. Trubian. Ant system for job-shop scheduling. JORBEL - Belgian Journal of Operations Research, Statistics and Computer Science, 34:39-53, 1994.
2. M. Dorigo, V. Maniezzo, and A. Colorni. The ant system: Optimization by a colony of cooperating agents. IEEE Trans. Systems, Man, and Cybernetics - Part B, 26:29-41, 1996.
3. S. van der Zwaan and C. Marques. Ant colony optimisation for job shop scheduling. In Proceedings of the Third Workshop on Genetic Algorithms and Artificial Life (GAAL 99), 1999.
4. T. Stutzle. An ant approach for the flow shop problem. In Proceedings of the 6th European Congress on Intelligent Techniques & Soft Computing (EUFIT ’98), volume 3, pages 1560-1564. Verlag Mainz, Aachen, 1998.
5. A. Bauer, B. Bullnheimer, R.F. Hartl, and C. Strauss. An ant colony optimization approach for the single machine total tardiness problem. In Proceedings of the 1999 Congress on Evolutionary Computation (CEC99), 6-9 July Washington D.C., USA, pages 1445-1450, 1999.
6. M.L den Besten, T. Stutzle, and M. Dorigo. Ant colony optimization for the total weighted tardiness problem. In M. Schoenauer et al., editor, Parallel Problem Solving from Nature: 6th international conference, volume 1917 of Lecture Notes on Computer Science, pages 611-620, Berlin, September 2000. Springer Verlag.
7. D. Merkle and M. Middendorf. An ant algorithm with a new pheromone evaluation rule for total tardiness problems. In Proceeding of the EvoWorkshops 2000, number 1803 in Lecture Notes in Computer Science, pages 287-296. Springer Verlag, 2000.
8. D. Merkle, M. Middendorf, and H. Schmeck. Ant colony optimization for resource-constrained project scheduling. In D. Whitley et al., editor, Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2000), pages 893-900, Las Vegas, Nevada, USA, 10-12 July 2000. Morgan Kaufmann.
9. M. Dorigo and G. Di Caro. The ant colony optimization meta-heuristic. In D. Corne, M. Dorigo, and F. Glover, editors, New Ideas in Optimization, pages 11-32. McGraw-Hill, 1999.
10. http://mscmga.ms.ic.ac.uk/jeb/orlib/wtinfo.html.
11. M.R. Garey and D.S. Johnson. Computers and Intractibility: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York, 1979.
12. P.S. Ow and T.E. Morton. The single machine early/tardy problem. Management Science, 35:177-191, 1998.
13. R. Michels and M. Middendorf. An ant system for the shortest common super-sequence problem. In D. Corne, M. Dorigo, and F. Glover, editors, New Ideas in Optimization, pages 51-61. McGraw-Hill, 1999.