Ant colony optimization with global pheromone evaluation for scheduling a single machine

Applied Intelligence

Volumn 18, Issue 1, 2003, Pages 105-111

  Merkle, Daniel ^a   Middendorf, Martin ^b  

^a UNIVERSITY OF KARLSRUHE   (Germany)

^b UNIVERSITY OF LEIPZIG   (Germany)

Author keywords

Ant algorithms; Scheduling; Tardiness

Indexed keywords

DECISION THEORY; GLOBAL OPTIMIZATION; HEURISTIC METHODS; ITERATIVE METHODS; PROBLEM SOLVING; SCHEDULING;

ANT COLONY OPTIMIZATION; GLOBAL PHEROMONE EVALUATION; PRIORITY SCHEDULING HEURISTICS; SINGLE MACHINE TOTAL WEIGHTED TARDINESS PROBLEM;

ALGORITHMS;

EID: 0037272238     PISSN: 0924669X     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1020999407672     Document Type: Article

References (14)

1. M. Dorigo and G. Di Caro, "The ant colony optimization metaheuristic," in New Ideas in Optimization, edited by D. Corne, M. Dorigo, and F. Glover, McGraw-Hill, pp. 11-32, 1999.
2. P. Forsyth and A. Wren, "An ant system for bus driver scheduling," University of Leeds--School of Computer Studies, Report 97, 25, 1997.
3. 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, vol. 34, pp. 39-53, 1994.
4. 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, vol. 26, pp. 29-41, 1996.
5. T. Stützle, "An ant approach for the flow shop problem," in Proc. of the 6th European Congress on Intelligent Techniques & Soft Computing (EUFIT '98), vol. 3, Verlag Mainz, Aachen, 1998, pp. 1560-1564.
6. 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), Washington D.C., USA, 6-9 July, 1999, 1445-1450.
7. R. Michels and M. Middendorf, "An ant system for the shortest common super-sequence problem," in New Ideas in Optimization, edited by D. Corne, M. Dorigo, and F. Glover, McGraw-Hill, pp. 692-701, 1999.
8. D. J. Du and J. Y.-T. Leung, "Minimizing the total tardiness on one machine is NP-hard," Mathematics of Operations Research, vol. 15, pp. 483-496, 1990.
9. E. L. Lawler, "A 'pseudopolynomial' algorithm for sequencing jobs to minimize total tardiness," Annals of Discrete Mathematics, pp i:331-342, 1977.
10. H.A.J. Crauwels, C.N. Potts, and L.N. Van Wassenhove, "Local search heuristics for the single machine total weighted tardiness scheduling problem," INFORMS Journal on Computing, vol. 10, pp. 341-359, 1998.
11. R. K. Congram, C. N. Potts, and S. L. van de Velde, "An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem," INFORMS Journal on Computing, vol. 14, pp. 52-57, 2002.
12. M. Drigo and L. M. Gambardella, "Ant colony system: A cooperative learning approach to the travelling salesman problem," IEEE Trans. on Evolutionary Comp., vol. 1, pp. 53-66, 1997.
13. http://mscmga.ms.ic.ac.uk/jeb/orlib/wtinfo.html.
14. M. den Besten, T. Stützle, and M. Dorigo, "Ant colony optimization for the total weighted tardiness problem," in Parallel Problem Solving from Nature: 6th International Conference, edited by M. Schoenauer et al., Springer-Verlag, LNCS 1917, pp. 611-620, 2000.