An effective ant colony optimization-based algorithm for flow shop scheduling

SMCia/08 - Proceedings of the 2008 IEEE Conference on Soft Computing on Industrial Applications

Volumn , Issue , 2008, Pages 101-106

  Chen, Ruey Maw ^a   Lo, Shih Tang ^b   Wu, Chung Lun ^a   Lin, Tsung Hung ^a  

^a NATIONAL CHIN YI UNIVERSITY OF TECHNOLOGY   (Taiwan)

^b KUN SHAN UNIVERSITY   (Taiwan)

Author keywords

Ant colony optimization (ACO); Flow shop problem (FSP); Local search; Meta heuristics; Scheduling

Indexed keywords

ANT COLONY OPTIMIZATION (ACO); ANT COLONY OPTIMIZATION ALGORITHMS; ANT-COLONY OPTIMIZATION; FLOW SHOP PROBLEM (FSP); FLOW SHOP PROBLEMS; FLOW SHOP SCHEDULING PROBLEM; FLOW-SHOP SCHEDULING; FORAGING BEHAVIORS; LOCAL OPTIMAL; LOCAL SEARCH; META-HEURISTICS; META-HEURISTICS ALGORITHMS; MODIFIED SCHEME; NP-HARD; QUALITY OF SOLUTION; SCHEDULING PROBLEM; SIMULATION RESULT; STATE TRANSITION RULE;

COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE; FLOW SIMULATION; HEURISTIC METHODS; INDUSTRIAL APPLICATIONS; MACHINE SHOP PRACTICE; OPTIMIZATION; SOFT COMPUTING;

SCHEDULING ALGORITHMS;

EID: 70349282021     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SMCIA.2008.5045943     Document Type: Conference Paper

References (15)

1. P.K. Jain and P.K. Sharma, "An ant colony algorithm for job shop scheduling problem;Systems," Man and Cybernetics, 2005 IEEE International Conference on Volume1, Oct. 2005, pp.288-292.
2. A. Zhu and S.X. Yang, "A Neural Network Approach to Dynamic Task Assignment of Multirobots," Neural Networks, IEEE Transactions on Volume17, Issue 5, Sept. 2006 Page(s):1278-1287.
3. L. Ozdamar, "A genetic algorithm approach to a general category project scheduling problem," Systems, Man and Cybernetics, Part C, IEEE Transactions on Volume29, Issue 1, Feb. 1999 Page(s):44-59.
4. K. C. Ying and C. J. Liao, "An ant colony system for permutation flow-shop sequencing," Computers and Operations Research,Volume 31 , Issue 5,1 2004, pp. 791-801.
5. R. Kahg, Machine scheduling problems. The Hague: Martinus Nijhoff, 1967.
6. M. R. Garey and D.S. Johnson. Computers and Intractability: a Guide to the Theory of NP-Completeness. Freeman, San Francisco, 1979.
7. J. H. Holland, "Genetic algorithms and classifier systems: foundations and future directions," Proceedings of the Second International Conference on Genetic Algorithms on Genetic algorithms and their application, Cambridge, Massachusetts, United States Pages: 82 - 89 Year of Publication: 1987.
8. S. Kirkpatrick, C. D. Gelatt Jr., and M. P. Vecchi, "Optimization by Simulated Annealing," Science 13 May 1983: Vol. 220. no. 4598, pp. 671-680.
9. F. W. Glover and M. Laguna, Tabu Search ;1997 Springer.
10. J. Kennedy and R. C. Eberhart, "Particle swarm optimization," Proceedings IEEE Int'l. Conf. on Neural Networks, 4, (1995), pp.1942-1948.
11. M. Dorigo, M. Birattari and T. Stützle, "Ant colony optimization," Computational Intelligence Magazine, IEEE Volume1, Issue 4, Nov. 2006 Page(s):28-39.
12. I. H. Osman and C. N. Potts, Simulated annealing for permutation flow-shop scheduling. OMEGA, 17, 1989, pp. 551-557.
13. M. Dorigo and L.M. Gambardella, "Ant colony system: A cooperative learning approach to the traveling salesman problem," IEEE Transactions on Evolutionary Computation 1997; 1(1), pp. 53-66.
14. Z. Liu and S. Wang, "Hybrid Particle Swarm Optimization for Permutation Flow Shop Scheduling," Intelligent Control and Automation, 2006. WCICA 2006. The Sixth World Congress on Volume1, 2006 Page(s):3245-3249.
15. R. R. Colin, " A genetic algorithm for &owshop sequencing," Computers and Operations Research 1995;22, pp.5-13.