A modified ant colony algorithm for the job shop scheduling problem to minimize makespan

2010 International Conference on Mechanic Automation and Control Engineering, MACE2010

Volumn , Issue , 2010, Pages 3627-3630

  Zhang, Zhiqiang ^a   Zhang, Jing ^a   Li, Shujuan ^a  

^a XI'AN UNIVERSITY OF TECHNOLOGY   (China)

Author keywords

Ant Colony Optimization; Job shop scheduling problem; Local search; Priority rule

Indexed keywords

ACO ALGORITHMS; ANT COLONY ALGORITHMS; ANT COLONY OPTIMIZATION ALGORITHMS; ANT-COLONY OPTIMIZATION; EXISTING PROBLEMS; HEURISTIC INFORMATION; JOB SHOP SCHEDULING PROBLEM; JOB SHOP SCHEDULING PROBLEMS; LOCAL SEARCH; MAKESPAN; MAKESPAN CRITERION; PRIORITY RULES; SOLUTION QUALITY;

ARTIFICIAL INTELLIGENCE; MECHANICS; OPTIMIZATION; SCHEDULING ALGORITHMS;

CONVERGENCE OF NUMERICAL METHODS;

EID: 77956072712     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/MACE.2010.5535635     Document Type: Conference Paper

References (15)

1. Blazewicz J. and W. Domschke, "The job shop scheduling problem: Conventional and new solution techniques," European Journal of Operational Research, vol. 93, pp.1-33, August 1996 (Pubitemid 126389264)
2. Dell'Amico M. and M. Trubian, "Applying tabu search to the job-shop scheduling problem," Annals of Operations Research, vol. 41, pp. 231-252, September 1993
3. Nowicki E. and C. Smutnicki, "A Fast Taboo Search Algorithm for the Job Shop Problem," MANAGEMENT SCIENCE, vol. 42, pp. 797-13, June 1996
4. Wang, L. and D. Z. Zheng, "A Modified Genetic Algorithm for Job Shop Scheduling," The International Journal of Advanced Manufacturing Technology, vol. 20, pp. 72-76, July 2002
5. Kamrul Hasan S. M. and R. Sarker, " Modified genetic algorithm for job-shop scheduling: A gap utilization technique," in IEEE Congress on Evolutionary Computation(CEC 2007), IEEE Press, Piscataway, NJ, pp. 3804-3811, September 2007
6. Aydin M. E. and T. C. Fogarty, "A simulated annealing algorithm for multi-agent systems: a job-shop scheduling application," Journal of Intelligent Manufacturing, vol. 15, pp. 805-814, December 2004
7. Yamada T. and B. E. Rosen, "A simulated annealing approach to job shop scheduling using critical block transition operators," in Proc. of IEEE International Conference on Neural Networks (ICNN '94), IEEE Press, Piscataway, NJ, pp.4687-4692, June 1994
8. Dorigo M. and Stützle T., Ant Colony Optimization. Cambridge, MA: MIT Press, 2004
9. Zhou P. and X.-p. Li, "An ant colony algorithm for job shop scheduling problem," in Fifth World Congress on Intelligent Control and Automation, IEEE Press, Piscataway, NJ, pp. 2899-2903, June 2004
10. FiglalI N. and C. Özkale, "Investigation of Ant System parameter interactions by using design of experiments for job-shop scheduling problems," Computers & Industrial Engineering, vol. 56, pp. 538-559, March 2009
11. URSZULA BORYCZKA, "Ant Colony System for JSP," in ACRI 2004, LNCS,vol. 3305, pp. 296-305, September 2004
12. Xiao-Ian Z. and Z. Jun, "A new pheromone design in ACS for solving JSP," in IEEE Congress on Evolutionary Computation(CEC 2007), IEEE Press, Piscataway, NJ, pp. 1963-1969, September 2007
13. Montgomery J., "Alternative Solution Representations for the Job Shop Scheduling Problem in Ant Colony Optimization," In M. Randall, H.A. Abbass, and J. Wiles (Eds.), ACAL 2007, LNAI, vol. 4828, pp. 1-12, Springer, Heidelberg, November 2007
14. Heinonen J. and F. Pettersson, "Hybrid ant colony optimization and visibility studies applied to a job-shop scheduling problem," Applied Mathematics and Computation, vol. 187, pp. 989-998, April 2007
15. Jain A. S. and B. Rangaswamy, "New and "Stronger" Job-Shop Neighbourhoods: A Focus on the Method of Nowicki and Smutnicki (1996)," Journal of Heuristics,vol. 6, pp. 457-480, September 2000