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

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.

[1]  Marco Dorigo,et al.  Ant system for Job-shop Scheduling , 1994 .

[2]  Mohamed Ben-Daya,et al.  A simulated annealing approach for the one-machine mean tardiness scheduling problem , 1996 .

[3]  Luca Maria Gambardella,et al.  HAS-SOP: Hybrid Ant System for the Sequential Ordering Problem , 1997 .

[4]  E. Lawler.  A “Pseudopolynomial” Algorithm for Sequencing Jobs to Minimize Total Tardiness , 1977 .

[5]  G. Di Caro,et al.  Ant colony optimization: a new meta-heuristic , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[6]  Thomas Stützle,et al.  An Ant Approach to the Flow Shop Problem , 1998 .

[7]  Luca Maria Gambardella,et al.  Ant Algorithms for Discrete Optimization , 1999, Artificial Life.

[8]  Alain Hertz,et al.  Ants can colour graphs , 1997 .

[9]  J. D. Irwin,et al.  An Improved Method for Scheduling Independent Tasks , 1971 .

[10]  Luca Maria Gambardella,et al.  Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..

[11]  Richard F. Hartl,et al.  Applying the ANT System to the Vehicle Routing Problem , 1999 .

[12]  Roberto Tadei,et al.  A new decomposition approach for the single machine total tardiness scheduling problem , 1998, J. Oper. Res. Soc..

[13]  Randolph M. Russell,et al.  Evaluation of leading heuristics for the single machine tardiness problem , 1997 .

[14]  Marshall L. Fisher,et al.  A dual algorithm for the one-machine scheduling problem , 1976, Math. Program..

[15]  Christos Koulamas,et al.  A heuristic for the single machine tardiness problem , 1993 .

[16]  Marco Dorigo,et al.  Distributed Optimization by Ant Colonies , 1992 .

[17]  Vittorio Maniezzo,et al.  The Ant System Applied to the Quadratic Assignment Problem , 1999, IEEE Trans. Knowl. Data Eng..

[18]  Richard F. Hartl,et al.  An improved Ant System algorithm for theVehicle Routing Problem , 1999, Ann. Oper. Res..

[19]  R. M. Russell,et al.  A Heuristic Algorithm for Sequencing on One Machine to Minimize Total Tardiness , 1992 .

[20]  Marco Dorigo,et al.  Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.

[21]  Marco Dorigo,et al.  The ant colony optimization meta-heuristic , 1999 .

[22]  T. Stützle,et al.  MAX-MIN Ant System and local search for the traveling salesman problem , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).

[23]  Hamilton Emmons,et al.  One-Machine Sequencing to Minimize Certain Functions of Job Tardiness , 1969, Oper. Res..

[24]  Chris N. Potts,et al.  Single Machine Tardiness Sequencing Heuristics , 1991 .

[25]  Joseph Y.-T. Leung,et al.  Minimizing Total Tardiness on One Machine is NP-Hard , 1990, Math. Oper. Res..

[26]  Linus Schrage,et al.  Dynamic Programming Solution of Sequencing Problems with Precedence Constraints , 1978, Oper. Res..

[27]  B. Bullnheimer,et al.  A NEW RANK BASED VERSION OF THE ANT SYSTEM: A COMPUTATIONAL STUDY , 1997 .

[28]  Philip M. Morse,et al.  Letter to the Editor - A Family of Queuing Problems , 1954, Oper. Res..

[29]  M. Dorigo,et al.  1 Positive Feedback as a Search Strategy , 1991 .

[30]  Chris N. Potts,et al.  A decomposition algorithm for the single machine total tardiness problem , 1982, Oper. Res. Lett..

[31]  Marco Dorigo,et al.  An Investigation of some Properties of an "Ant Algorithm" , 1992, PPSN.

[32]  Wlodzimierz Szwarc,et al.  Decomposition of the single machine total tardiness problem , 1996, Oper. Res. Lett..

[33]  R M Russell,et al.  Evaluation of greedy, myopic and less-greedy heuristics for the single machine, total tardiness problem , 1997 .

[34]  Marco Dorigo,et al.  Optimization, Learning and Natural Algorithms , 1992 .

[35]  T. Fry,et al.  A Heuristic Solution Procedure to Minimize T on a Single Machine , 1989 .