Developing Issues for Ant Colony System Based Approach for Scheduling Problems

This paper describes some developing issues for ACS based software tools to support decision making process and solve the problem of generating a sequence of jobs that minimizes the total weighted tardiness for a set of jobs to be processed in a single machine. An Ant Colony System (ACS) based algorithm performance is validated with benchmark problems available in the OR library. The obtained results were compared with the optimal (best available results in some cases) and permit to conclude about ACS efficiency and effectiveness. The ACS performance and respective statistical significance was evaluated.

[1]  Kenneth R. Baker,et al.  Optimization Methods for the Single‐Machine Problem , 2009 .

[2]  Mauro Birattari,et al.  Swarm Intelligence , 2012, Lecture Notes in Computer Science.

[3]  R. Reynolds.  AN INTRODUCTION TO CULTURAL ALGORITHMS , 2008 .

[4]  Corso Elvezia,et al.  Ant colonies for the traveling salesman problem , 1997 .

[5]  M. Pirlot.  General local search methods , 1996 .

[6]  Xin Yao,et al.  Parallel Problem Solving from Nature PPSN VI , 2000, Lecture Notes in Computer Science.

[7]  Yves Robert,et al.  Introduction to Scheduling , 2009, CRC computational science series.

[8]  Luca Maria Gambardella,et al.  Solving symmetric and asymmetric TSPs by ant colonies , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

[9]  Massimo Paolucci,et al.  A New Ant Colony Optimization Approach for the Single Machine Total Weighted Tardiness Scheduling Problem , 2008 .

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

[11]  El-Ghazali Talbi,et al.  Metaheuristics - From Design to Implementation , 2009 .

[12]  Manuel López-Ibáñez,et al.  Ant colony optimization , 2010, GECCO '10.

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

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

[15]  Jean-Charles Billaut,et al.  Introduction to scheduling , 2002 .

[16]  Daniel Merkle,et al.  On solving permutation scheduling problems with ant colony optimization , 2005, Int. J. Syst. Sci..

[17]  Ivo Pereira,et al.  Ant Colony System based approach to single machine scheduling problems: Weighted tardiness scheduling problem , 2012, 2012 Fourth World Congress on Nature and Biologically Inspired Computing (NaBIC).

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

[19]  Thomas Stützle,et al.  Ant colony optimization: artificial ants as a computational intelligence technique , 2006 .

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

[21]  Mehmet Mutlu Yenisey,et al.  Ant colony optimization for multi-objective flow shop scheduling problem , 2008, Comput. Ind. Eng..

[22]  Kenneth R. Baker,et al.  Principles of Sequencing and Scheduling , 2018 .

[23]  M Dorigo,et al.  Ant colonies for the travelling salesman problem. , 1997, Bio Systems.

[24]  N. R. Srinivasa Raghavan,et al.  Parallel processor scheduling for minimizing total weighted tardiness using ant colony optimization , 2009 .

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

[26]  Thomas Stützle,et al.  Parameter Adaptation in Ant Colony Optimization , 2012, Autonomous Search.