A New Approach to Solve Permutation Scheduling Problems with Ant Colony Optimization

  • Daniel Merkle
  • Martin Middendorf
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2037)


A new approach for solving permutation scheduling problems with Ant Colony Optimization is proposed in this paper. The approach assumes that no precedence constraints between the jobs have to be fulfilled. It is tested with an ant algorithm for the Single Machine Total Weighted Deviation Problem. The new approach uses ants that allocate the places in the schedule not sequentially, as the standard approach, but in random order. This leads to a better utilization of the pheromone information. It is shown that adequate combinations between the standard approach which can profit from list scheduling heuristics and the new approach perform particularly well.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 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.zbMATHGoogle Scholar
  2. 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.CrossRefGoogle Scholar
  3. 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.Google Scholar
  4. 4.
    T. Stützle. 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.Google Scholar
  5. 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.Google Scholar
  6. 6.
    M.L den Besten, T. Stützle, 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.Google Scholar
  7. 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.Google Scholar
  8. 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.Google Scholar
  9. 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.Google Scholar
  10. 10.
  11. 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.zbMATHGoogle Scholar
  12. 12.
    P.S. Ow and T.E. Morton. The single machine early/tardy problem. Management Science, 35:177–191, 1998.MathSciNetCrossRefzbMATHGoogle Scholar
  13. 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.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Daniel Merkle
  • Martin Middendorf
    • 1
  1. 1.Institute for Applied Computer Science and Formal Description MethodsUniversity of KarlsruheGermany

Personalised recommendations