Minimizing Total Tardiness on a Single Machine Using Ant Colony Optimization

Ant Colony Optimization is a relatively new meta heuristic that has proven its quality and versatility on various combinatorial opti mization problems such as the traveling salesman problem the vehicle routing problem and the job shop scheduling problem The paper in troduces an Ant Colony Optimization approach to solve the problem of determining a job sequence that minimizes the overall tardiness for a given set of jobs to be processed on a single continuously available machine the Single Machine Total Tardiness Problem We experiment with various heuristic information as well as with variants for local search Experiments with benchmark problems with and jobs illustrate that Ant Colony Optimization is an adequate method to tackle the SMTTP

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

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

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

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

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

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

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

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

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

[10]  Chris N. Potts,et al.  A Branch and Bound Algorithm for the Total Weighted Tardiness Problem , 1985, Oper. Res..

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

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

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

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

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

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

[17]  Chris N. Potts,et al.  Local Search Heuristics for the Single Machine Total Weighted Tardiness Scheduling Problem , 1998, INFORMS J. Comput..

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

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

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

[21]  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).

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

[23]  Hirofumi Matsuo,et al.  A controlled search simulated annealing method for the single machine weighted tardiness problem , 1990 .

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

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

[26]  M. Selim Akturk,et al.  A new lower bounding scheme for the total weighted tardiness problem , 1998, Comput. Oper. Res..

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

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

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

[30]  Jan Karel Lenstra,et al.  Complexity of machine scheduling problems , 1975 .

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

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

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

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

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

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