A modified Ant Colony algorithm for the Job Shop Scheduling Problem to minimize makespan

This paper presents a modified Ant Colony Optimization (ACO) algorithm for the Job Shop Scheduling Problem (JSSP) with makespan criterion. The traditional ACO algorithms can be simplified with the elimination of pheromone unimportant to the JSSP solution. Also, this paper suggests a new priority rule served as the heuristic information of the proposed algorithm. In order to improve the convergence and solution qualities of the proposed algorithm, the local search procedure based on the neighborhood of the JSSP is introduced. The experimental results indicate that the modified ACO algorithm in this paper is more concise and more effective than ACO algorithms. Furthermore, this paper discloses the existing problems of ACO algorithms for the JSSP.

[1]  E. Nowicki,et al.  A Fast Taboo Search Algorithm for the Job Shop Problem , 1996 .

[2]  F. Pettersson,et al.  Hybrid ant colony optimization and visibility studies applied to a job-shop scheduling problem , 2007, Appl. Math. Comput..

[3]  Ling Wang,et al.  A Modified Genetic Algorithm for Job Shop Scheduling , 2002 .

[4]  Bruce E. Rosen,et al.  A simulated annealing approach to job shop scheduling using critical block transition operators , 1994, Proceedings of 1994 IEEE International Conference on Neural Networks (ICNN'94).

[5]  Mehmet Emin Aydin,et al.  A simulated annealing algorithm for multi-agent systems: a job-shop scheduling application , 2004, J. Intell. Manuf..

[6]  Sheik Meeran,et al.  New and “Stronger” Job-Shop Neighbourhoods: A Focus on the Method of Nowicki and Smutnicki (1996) , 2000, J. Heuristics.

[7]  Urszula Boryczka.  Ant Colony System for JSP , 2004, ACRI.

[8]  Ruhul A. Sarker,et al.  Modified genetic algorithm for job-shop scheduling: A gap utilization technique , 2007, 2007 IEEE Congress on Evolutionary Computation.

[9]  Orhan Engin,et al.  Investigation of Ant System parameter interactions by using design of experiments for job-shop scheduling problems , 2009, Comput. Ind. Eng..

[10]  Zhou Pin,et al.  An ant colony algorithm for job shop scheduling problem , 2004, Fifth World Congress on Intelligent Control and Automation (IEEE Cat. No.04EX788).

[11]  James Montgomery.  Alternative Solution Representations for the Job Shop Scheduling Problem in Ant Colony Optimisation , 2007, ACAL.

[12]  Jacek Blazewicz,et al.  The job shop scheduling problem: Conventional and new solution techniques , 1996 .

[13]  Thomas Stützle,et al.  Ant Colony Optimization Theory , 2004 .

[14]  Mauro Dell'Amico,et al.  Applying tabu search to the job-shop scheduling problem , 1993, Ann. Oper. Res..

[15]  Jun Zhang,et al.  A new pheromone design in ACS for solving JSP , 2007, 2007 IEEE Congress on Evolutionary Computation.