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

Proceedings of the 1999 Congress on Evolutionary Computation, CEC 1999

Volumn 2, Issue , 1999, Pages 1445-1450

  Bauer, Andreas ^a   Bullnheimer, Bernd ^a   Hartl, Richard F ^a   Strauss, Christine ^a  

^a UNIVERSITY OF VIENNA   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; MACHINERY; OPTIMIZATION; PRODUCTION CONTROL; SCHEDULING; SCHEDULING ALGORITHMS;

BENCH-MARK PROBLEMS; COMBINATORIAL OPTIMIZATION PROBLEMS; COMPUTATIONAL RESULTS; MACHINE SCHEDULING; MACHINE SCHEDULING PROBLEM; METAHEURISTIC; PRODUCTION PLANNING; SINGLE MACHINE TOTAL TARDINESS PROBLEM;

PROBLEM SOLVING;

EID: 28644443263     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CEC.1999.782653     Document Type: Conference Paper

References (35)

1. Bauer, A. (1998): Ant Colony Optimization for the Single Machine Total Tardiness Problem, unpublished Master Thesis (in german), Department of Management Science, University of Vienna, Austria.
2. Ben-Daya, M. and M. Al-Fawzan (1996): A Simulated Annealing Approach for the One-Machine Mean Tardiness Scheduling Problem, European Journal of Operational Research 93 pp. 61-67.
3. Bullnheimer, B., R. F. Hartl and C. Strauss (1997): A New Rank Based Version of the Ant System - A Computational Study, Working Paper No. 1, SFB Adaptive Information Systems and Modelling in Economics and Management Science. To appear in CEJOR.
4. Bullnheimer, B., R. F. Hartl and C Strauss (1997): An Improved Ant System Algorithm for the Vehicle Routing Problem, POM Working Paper No. 10/97, University of Vienna. To appear in Annals of Operations Research.
5. Bullnheimer, B., R. F. Hartl and C. Strauss (1998): Applying the Ant System to the Vehicle Routing Problem, in: S. Voss, S. Martello, I. H. Osman and C. Roucairol, eds, Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization, Kluwer, Boston, pp. 109-120.
6. Colorni, A., M. Dorigo and V. Maniezzo (1991): Distributed Optimization by Ant Colonies, Proceedings of European Conference on Artificial Life ECAL'91, Paris, France, Elsevier Publishing, pp. 134-142.
7. Colorni, A., M. Dorigo and V. Maniezzo (1992): Investigation of Some Properties of an Ant Algorithm, Proceedings of Parallel Problem Solving from Nature, Brussels, Elsevier, pp. 509-520.
8. Colorni, A., M. Dorigo, V. Maniezzo and M. Trubian (1994): Ant System for Job-Shop Scheduling, JORBEL - Belgian Journal of Operations Research, Statistics and Computer Science 34 (1) pp. 39-53.
9. Costa, D. and A. Hertz (1997): Ants can Colour Graphs, Journal of the Operational Research Society 48 pp. 295-305.
10. Delia Croce, F., R. Tadei, P. Baracco and A. Grosso (1998): A New Decomposition Approach for the Single Machine Total Tardiness Scheduling Problem, Journal of the Operational Research Society 49 pp. 1101-1106.
11. Dorigo, M. (1992): Optimization, Learning and Natural Algorithms, Ph. D. Dissertation (in italian), Politecnico di Milano, Milano, Italy.
12. Dorigo, M. and G. Di Caro (1999): The Ant Colony Optimization Meta-Heuristic, in: D. Corne, M. Dorigo and F. Glover, eds, New Ideas in Optimization, McGraw-Hill.
13. Dorigo M., G. Di Caro and L. M. Gambardella (1998): Ant Algorithms for Discrete Optimization, Technical Report IRIDIA/98-10, Universite Libre de Bruxelles, Belgium. To appear in Artificial Life.
14. Dorigo, M. and L. M. Gambardella (1997): Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem, IEEE Transactions on Evolutionary Computation 1 pp. 53-66.
15. Dorigo, M., V. Maniezzo and A. Colorni (1991): Positive FeedBäck as a Search Strategy, Technical Report 91-016, Dip. Elettronica, Politecnico di Milano, Italy.
16. Dorigo, M., V. Maniezzo and A. Colorni (1996): Ant System: Optimization by a Colony of Cooperating Agents, IEEE Transactions on Systems, Man, and Cybernetics 26 (1) pp. 29-41.
17. Du, J. and J. Y.-T. Leung (1990): Minimizing Total Tardiness on One Machine is NP-Hard, Mathematics of Operations Research 15 pp. 483-495.
18. Emmons, H. (1969): One Machine Sequencing to Minimize Certain Functions of Tardiness, Operations Research 17 pp. 701-715.
19. Fisher, M. L. (1976): A Dual Algorithm for the One-Machine Scheduling Problem, Mathematical Programming 11 pp. 229-251.
20. Fry, T. D., L. Vicens, K. Macleod and S. Fernandez (1989): A Heuristic Solution Procedure to Minimize T on a Single Machine, Journal of the Operational Research Society 40 pp. 293-297.
21. Gambardella, L. M. and M. Dorigo (1997): HAS-SOP: An Hybrid Ant System for the Sequential Ordering Problem, Technical Report IDSIA/11-97, ID-SIA, Lugano, Switzerland.
22. Gutjahr, W. J. (1998): A Generalized Ant System and its Convergence, Technical Report 98-10, Department of Statistics, Operations Research and Computer Science, University of Vienna, Austria.
23. HolsenBäck, J. E. and R. M. Russell (1992): A Heuristic Algorithm for Sequencing on One Machine to Minimize Total Tardiness, Journal of the Operational Research Society 43 pp. 53-62.
24. Lawler, E. L. (1977): A Pseudopolynomial Algorithm for Sequencing Jobs to Minimize Total Tardiness, Annals of Discrete Mathematics 1 pp. 331-342.
25. Maniezzo, V., A. Colorni and M. Dorigo (1994): The Ant System applied to the Quadratic Assignment Problem, Technical Report No. 94-28, IRIDIA, Brussels, Belgium.
26. Panwalkar, S. S., M. L. Smith and C. P. Koulamas (1993): A Heuristic for the Single Machine Tardiness Problem, European Journal of Operational Research 70 pp. 304-310.
27. Potts, C. N. and L. N. Van Wassenhove (1982): A Decomposition Algorithm for the Single Machine Tardiness Problem, Operations Research Letters 32 pp. 177-181.
28. Potts, C. N. and L. N. Van Wassenhove (1991): Single Machine Tardiness Sequencing Heuristics, HE Transactions 23 pp. 346-354.
29. Russell, R. M. and J. E. HolsenBäck (1997a): Evaluation of Greedy, Myopic and Less-Greedy Heuristics for the Single Machine, Total Tardiness Problem, Journal of the Operational Research Society 48 pp. 640-646.
30. Russell, R. M. and J. E. HolsenBäck (1997b): Evaluation of leading heuristics for the single machine tardiness problem, European Journal of Operational Research 96 pp. 538-545.
31. Schrage, L. E. and K. R. Baker (1978): Dynamic Programming Solution of Sequencing Problems with Precedence Constraints, Operations Research 2 pp. 444-449.
32. Stiitzle, T. (1998): An Ant Approach to the Flow Shop Problem, Proceedings of EUFIT'98, Aachen, pp. 1560-1564.
33. Stiitzle, T. and H. Hoos (1997): The MAX-MIN Ant System and Local Search for the Traveling Salesman Problem, Proceedings of IEEE 4th International Conference on Evolutionary Computation ICEC'97, IEEE Press, pp. 308-313.
34. Szwarc, W. and S. Mukhopadhyay (1996): Decomposition of the Single Machine Total Tardiness Problem, Operations Research Letters 19 pp. 243-250.
35. Wilkerson, L. J, and Irwin, J. D. (1971): An Improved Algorithm for Scheduling Independent Tasks, AIIE Transactions 3 pp. 239-245.