Parallel processor scheduling for minimizing total weighted tardiness using ant colony optimization

In the modern business environment, meeting due dates and avoiding delay penalties are very important goals that can be accomplished by minimizing total weighted tardiness. We consider a scheduling problem in a system of parallel processors with the objective of minimizing total weighted tardiness. Our aim in the present work is to develop an efficient algorithm for solving the parallel processor problem as compared to the available heuristics in the literature and we propose the ant colony optimization approach for this problem. An extensive experimentation is conducted to evaluate the performance of the ACO approach on different problem sizes with the varied tardiness factors. Our experimentation shows that the proposed ant colony optimization algorithm is giving promising results compared to the best of the available heuristics.

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

[2]  Chandrabose Aravindan,et al.  A meta-heuristic approach to single machine scheduling problems , 2005 .

[3]  Thomas Stützle,et al.  Ant Colony Optimization , 2009, EMO.

[4]  T. Stützle,et al.  A Review on the Ant Colony Optimization Metaheuristic: Basis, Models and New Trends , 2002 .

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

[6]  Chandrasekharan Rajendran,et al.  Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs , 2004, Eur. J. Oper. Res..

[7]  Matthijs den Besten,et al.  Ant Colony Optimization for the Total Weighted Tardiness Problem , 2000, PPSN.

[8]  T.C.E. Cheng,et al.  A state-of-the-art review of parallel-machine scheduling research , 1990 .

[9]  Bahram Alidaee,et al.  Scheduling parallel machines to minimize total weighted and unweighted tardiness , 1997, Comput. Oper. Res..

[10]  W. Szwarc,et al.  Weighted Tardiness Single Machine Scheduling with Proportional Weights , 1993 .

[11]  James B. Orlin,et al.  Fast neighborhood search for the single machine total weighted tardiness problem , 2006, Oper. Res. Lett..

[12]  Graham Ritchie,et al.  Static Multi-processor Scheduling with Ant Colony Optimisation & Local Search , 2003 .

[13]  Ching-Jong Liao,et al.  An ant colony system approach for scheduling problems , 2003 .

[14]  Tapan Sen,et al.  Static scheduling research to minimize weighted and unweighted tardiness: A state-of-the-art survey , 2003 .

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

[16]  Bahram Alidaee,et al.  A computational experiment of COVERT-AU class of rules for single machine tardiness scheduling problem , 1996 .

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

[18]  Felix T.S. Chan,et al.  Impact of operation flexibility and dispatching rules on the performance of a flexible manufacturing system , 2004 .

[19]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

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

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

[22]  Carlos A. Coello Coello,et al.  THEORETICAL AND NUMERICAL CONSTRAINT-HANDLING TECHNIQUES USED WITH EVOLUTIONARY ALGORITHMS: A SURVEY OF THE STATE OF THE ART , 2002 .

[23]  R. Storer,et al.  A problem space algorithm for single machine weighted tardiness problems , 2003 .

[24]  G. Theraulaz,et al.  Inspiration for optimization from social insect behaviour , 2000, Nature.

[25]  Ching-Jong Liao,et al.  An ant colony optimization for single-machine tardiness scheduling with sequence-dependent setups , 2007, Comput. Oper. Res..

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

[27]  Ching-Jong Liao,et al.  An ant colony system for permutation flow-shop sequencing , 2004, Comput. Oper. Res..

[28]  Giovanni Righini,et al.  Heuristics from Nature for Hard Combinatorial Optimization Problems , 1996 .

[29]  Esther M. Arkin,et al.  Weighted-Tardiness Scheduling on Parallel Machines with Proportional Weights , 1991, Oper. Res..

[30]  Mehmet Fatih Tasgetiren,et al.  Particle swarm optimization algorithm for single machine total weighted tardiness problem , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).

[31]  Cyril Fonlupt,et al.  Parallel Ant Colonies for the quadratic assignment problem , 2001, Future Gener. Comput. Syst..

[32]  Chou-Yuan Lee,et al.  An immunity-based ant colony optimization algorithm for solving weapon-target assignment problem , 2002, Appl. Soft Comput..

[33]  John W. Fowler,et al.  Genetic algorithm based scheduling of parallel batch machines with incompatible job families to minimize total weighted tardiness , 2004 .

[34]  Ram Mohan V. Rachamadugu,et al.  Technical Note - A Note on the Weighted Tardiness Problem , 1987, Oper. Res..

[35]  T. S. Abdul-Razaq,et al.  Dynamic Programming State-Space Relaxation for Single-Machine Scheduling , 1988 .

[36]  Hing Kai Chan,et al.  A Fuzzy Multi-Criteria Decision-Making Technique for Evaluation of Scheduling Rules , 2002 .

[37]  Marc Gravel,et al.  Comparing an ACO algorithm with other heuristics for the single machine scheduling problem with sequence-dependent setup times , 2002, J. Oper. Res. Soc..

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

[39]  Chris N. Potts,et al.  A survey of algorithms for the single machine total weighted tardiness scheduling problem , 1990, Discret. Appl. Math..

[40]  Laurent Péridy,et al.  A Branch and Bound Algorithm to Minimize Total Weighted Tardiness on a Single Processor , 2004, Ann. Oper. Res..

[41]  Hartmut Schmeck,et al.  Pheromone evaluation in Ant Colony Optimization , 2000, 2000 26th Annual Conference of the IEEE Industrial Electronics Society. IECON 2000. 2000 IEEE International Conference on Industrial Electronics, Control and Instrumentation. 21st Century Technologies.

[42]  Nicolas Monmarché,et al.  An Ant Colony Optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem , 2002, Eur. J. Oper. Res..

[43]  Chris N. Potts,et al.  An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem , 2002, INFORMS J. Comput..