An effective hybrid particle swarm optimization algorithm for multi-objective flexible job-shop scheduling problem

Computers and Industrial Engineering

Volumn 56, Issue 4, 2009, Pages 1309-1318

  Zhang, Guohui ^a   Shao, Xinyu ^a   Li, Peigen ^a   Gao, Liang ^a  

^a HUAZHONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (China)

Author keywords

Flexible job shop scheduling; Multi objective optimization; Particle swarm optimization; Tabu search

Indexed keywords

COMBINATORIAL OP-TIMIZATION PROBLEMS; COMPUTATIONAL RESULTS; FLEXIBLE JOB-SHOP SCHEDULING; FLEXIBLE JOB-SHOP SCHEDULING PROBLEMS; GLOBAL SEARCHES; HYBRID ALGORITHMS; HYBRID APPROACHES; HYBRID PARTICLE SWARM OPTIMIZATION ALGORITHMS; JOB-SHOP SCHEDULING PROBLEMS; LOCAL SEARCHES; META-HEURISTIC; MULTI OBJECTIVES; NEAR-OPTIMAL SOLUTIONS; OPTIMIZATION ALGORITHMS; PARTICLE SWARM OPTIMIZATION ALGORITHMS; SEARCH EFFICIENCIES; TABU SEARCH ALGORITHMS;

COMBINATORIAL OPTIMIZATION; HEURISTIC METHODS; MULTIOBJECTIVE OPTIMIZATION; SCHEDULING ALGORITHMS; TABU SEARCH;

PARTICLE SWARM OPTIMIZATION (PSO);

EID: 67349174559     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cie.2008.07.021     Document Type: Article

References (19)

1. Baykasoglu A., Ozbakir L., and Sonmez A.I. Using multiple objective tabu search and grammars to model and solve multi-objective flexible job-shop scheduling problems. Journal of Intelligent Manufacturing 15 6 (2004) 777-785
2. Brandimarte P. Routing and scheduling in a flexible job shop by taboo search. Annals of Operations Research 41 3 (1993) 157-183
3. Chen, H., Ihlow, J., & Lehmann, C. (1999). A genetic algorithm for flexible job-shop scheduling. In Proceedings of IEEE international conference on robotics and automation (pp.1120-1125). Detroit.
4. Deb K. Multi-objective optimization using evolutionary algorithms (2001), Wiley, Chichester, UK
5. Garey M.R., Johnson D.S., and Sethi R. The complexity of flow shop and job-shop scheduling. Mathematics of Operations Research 1 (1976) 117-129
6. Glover F., and Laguna M. Tabu search (1997), Kluwer Academic Publishers
7. Hsu, T., Dupas, R., Jolly, D., & Goncalves, G. (2002). Evaluation of mutation heuristics for the solving of multiobjective flexible job shop by an evolutionary algorithm. In Proceedings of the 2002 IEEE international conference on systems, man and cybernetics (Vol. 5, pp. 655-660).
8. Hurink E., Jurisch B., and Thole M. Tabu search for the job shop scheduling problem with multi-purpose machine. Operations Research Spektrum 15 (1994) 205-215
9. Kacem I., Hammadi S., and Borne P. Approach by localization and multiobjective evolutionary optimization for flexible job-shop scheduling problems. IEEE transactions on systems, man, and cybernetics, Part C 32 1 (2002) 1-13
10. Kacem I., Hammadi S., and Borne P. Pareto-optimality approach for flexible job-shop scheduling problems: hybridization of evolutionary algorithms and fuzzy logic. Mathematics and Computers in Simulation 60 (2002) 245-276
11. Kennedy J. Particle swarm: social adaptation of knowledge. Proceedings of the 1997 IEEE international conference on evolutionary computation (1997), Indianapolis, USA 303-308
12. Kennedy, J., & Eberhart, R. (1995). Particle swarm optimization. In Proceedings of the 1995 IEEE international conference on neural network (Vol. IV, No. 4, pp. 1942-1948).
13. Lawler E.l., Lenstra J.K., Rinnooy Kan A.H.G., and Shmoys D.B. Sequencing and scheduling: Algorithms and complexity. In: Graves S.C., et al. (Ed). Logistics of production and inventory (1993), North Holland, Amsterdam 445-522
14. Mastrolilli M., and Gambardella L.M. Effective neighborhood functions for the flexible job shop problem. Journal of Scheduling 3 1 (2000) 3-20
15. Mesghouni, K., Hammadi, S., & Borne, P. (1997). Evolution programs for job-shop scheduling. In Proceedings of the 1997 IEEE international conference on systems, man and cybernetics (Vol. 1, pp. 720-725).
16. Parsopoulos K.E., and Vrahatis M.N. Recent approaches to global optimization problems through particle swarm optimization. Natural Computing 1 2-3 (2002) 235-306
17. Rigao C. Tardiness minimization in a flexible job shop: A tabu search approach. Journal of Intelligent Manufacturing 15 1 (2004) 103-115
18. Sonmez A.I., and Baykasoglu A. A new dynamic programming formulation of (n * m) flow shop sequencing problems with due dates. International Journal of Production Research 36 (1998) 2269-2283
19. Xia W.J., and Wu Z.M. An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems. Computers and Industrial Engineering 48 2 (2005) 409-425