Solving flexible job-shop scheduling problem using general particle swarm optimization

36th International Conference on Computers and Industrial Engineering, ICC and IE 2006

Volumn , Issue , 2006, Pages 3018-3027

  Gao, Liang ^a   Peng, Chuanyong ^a   Zhou, Chi ^a   Li, Peigen ^a  

^a HUAZHONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (China)

Author keywords

Flexible job shop scheduling; Genetic algorithm; Particle swarm optimization; Tabu search

Indexed keywords

COMBINATORIAL OPTIMIZATION PROBLEMS; CROSS-OVER PROBABILITY; CROSSOVER AND MUTATION; FLEXIBLE JOB-SHOP SCHEDULING; FLEXIBLE JOB-SHOP SCHEDULING PROBLEM; GLOBAL OPTIMUM SOLUTIONS; OPTIMIZATION MODELING; PARTICLE SWARM OPTIMIZATION MODELS;

GENETIC ALGORITHMS; INDUSTRIAL ENGINEERING; MATHEMATICAL MODELS; TABU SEARCH;

PARTICLE SWARM OPTIMIZATION (PSO);

EID: 84886901612     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (24)

1. Barnes, J.W., & Chambers, J.B. (1996). Flexible job shop scheduling by tabu search. Graduate Program in Operations Research and Industrial Engineering, The University of Texas at Austin, Technical Report Series, ORP96-09.
2. Brandimarte, P. (1993). Routing and scheduling in a flexible job shop by tabu search. Annals of Operations Research, 22, 158-183.
3. Cagnina, L., Esquivel, S. & Gallard, R. (2004). Particle swarm optimization for sequencing problems: A Case Study. In Proceedings of the 2004 Congress on Evolutionary Computation (pp. 536-541). New York: IEEE.
4. Carey, E.L., Johnson, D.S. & Sethi, R. (1976). The complexity of flowshop and job-shop scheduling. Mathematics of Operations Research, 1(2), 117-129.
5. Chen, H., Ihlow, J. & Lelmiann, C. (1999). A genetic algorithm for flexible job-shop scheduling. In Proceedings of the 1999 International Conference on Robotics & Automation (pp. 1120-1125). New York: IEEE.
6. Coello, C.A., Pulido, G.T. & Lechuga, M.S. (2004). Handling multiple objectives with particle swarm optimization. IEEE Transactions on Evolutionary Computation, 8(3), 256-279.
7. Dauzere-Peres, S. & Paulli, J. (1997). An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search. Annals of Operations Research, 70(1). 281-306.
8. Eberhart, R.C. & Hu X.H. (1999). Human Tremor Analysis Using particle swarm optimization. In Proceedings of the 1999 Congress on Evolutionary Computation (pp. 1927-1930). New York: IEEE.
9. Eberhart, R.C. & Shi Y. (2004). Guest Editorial: Special issue on particle swarm optimization. IEEE Transactions on Evolutionary Computation, 8(3), 201-203.
10. He, Z., Wei, C., Yang, L., et al. (1998). Extracting rules from fuzzy neural network by particle swarm optimization. In Proceedings of the 1998 International Conference on Evolutionary Computation (pp.74- 77). New York: IEEE.
11. Jensen, M.T. (2003). Generating Robust and flexible job shop schedules using genetic algorithms. IEEE Transactions on Evolutionary Computation, 7(3), 275-288.
12. Kacem, I., Hammadi, S. & Borne, P. (2002). Approach by localization and multiobjective evolutionary optimization for flexible job-shop scheduling problems. IEEE Transactions on Systems, Man and Cybernetics Part C: Applications and Reviews, 32(1), 1-13.
13. Kamian, S., Slochanal, S.M.R. & Subbarag, P. (2004). Application of particle swarm optimization technique and its variants to generation expansion planning problem. Electric Power Systems Research, 70(3), 203-210.
14. Kennedy, J. & Eberhart, R.C. (1995). Particle swarm optimization. In Proceedings of the 1995 International Conference on Neutral Networks (pp. 1942-1948). New York: IEEE.
15. Mastrolilli, M. & Gambardella, L.M. (2000). Effective neighbourhood functions for the flexible job shop problem. Journal of Scheduling, 3(1), 3-20.
16. Mati, Y., Rezq, N. & Xie, X. (2001). An integrated greedy heuristic for a flexible job shop scheduling problem. In Proceedings of the 2001 International Conference onSystems, Man and Cybernetics (pp. 2534-2539). New York: IEEE.
17. Najid, M., Stephane, D.P. & Zaidat A. (2002). A modified simulated annealing method for flexible job shop scheduling problem. In Proceedings of the 2002 International Conference on Systems, Man and Cybernetics (pp. 89-94). New York: IEEE.
18. Wang, K., Huang, L., Zhou, C. & Pang, W. (2003). Particle swarm optimization for traveling salesman problem. In Proceedings of the 2003 International Conference on Machine Learning and Cybernetics (pp. 1583-1585). New York: IEEE.
19. Wang, P., Wang, K.P., Zhou, C.G, Dong, L.J., Liu M. & Zhang Y. et al. (2004). Modified particle swarm optimization based 011 space transformation for solving traveling salesman problem. In Proceedings of the 2004 International Conference on Machine Learning and Cybernetics (pp. 2342-2346). New York: IEEE.
20. Ratnaweera, A., Halgamuge, S.K. & Watson, H.C. (2004). Self-organizing hierarchical particle swarm optimizer with time-varying acceleration coefficients. IEEE Transactions on Evolutionary Computation, 8(3), 240-255.
21. Tasgetiren, M.F., Liang, Y.C., Sevkli, M., & Gencyilmaz, G. (2004). Particle swarm optimization algorithm for single machine total weighted tardiness problem. In Proceedings of the 2004 Congress 011 Evolutionary Computation (pp. 1412-1419). New York: IEEE.
22. Trelea, I.C. (2003). The particle swarm optimization algorithm: convergence analysis and parameter selection. Information Processing Letters, 85(6), 317-325.
23. Xia, W. & Wu, Z. (2005). An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems. Computer & Industrial Engineering, 48(2), 409-425.
24. Zhang, H. & Gen M. (2005). Multistage-based genetic algorithm for flexible job-shop scheduling problem. Complexity International, 11, 223-232.