An effective and distributed particle swarm optimization algorithm for flexible job-shop scheduling problem

Journal of Intelligent Manufacturing

Volumn 29, Issue 3, 2018, Pages 603-615

  Nouiri, Maroua ^a   Bekrar, Abdelghani ^d,e   Jemai, Abderezak ^a   Niar, Smail ^d,e   Ammari, Ahmed Chiheb ^b,c  

^a FACULTÉ DES SCIENCES DE TUNIS   (Tunisia)

^b UNIVERSITY OF CARTHAGE   (Tunisia)

^c KING ABDULAZIZ UNIVERSITY   (Saudi Arabia)

^d LAMIH   (France)

^e UNIV LILLE   (France)

Author keywords

Enmbeded system; Flexible job shop scheduling problem; Makespan; Multi agent system; Particle swarm optimization algorithm; Routing and scheduling

Indexed keywords

ALGORITHMS; BENCHMARKING; COMBINATORIAL OPTIMIZATION; EMBEDDED SYSTEMS; MULTI AGENT SYSTEMS; OPTIMIZATION; PARTICLE SWARM OPTIMIZATION (PSO); PROBLEM SOLVING; REAL TIME SYSTEMS; SCHEDULING; SCHEDULING ALGORITHMS;

ENMBEDED SYSTEM; FLEXIBLE JOB-SHOP SCHEDULING PROBLEM; MAKESPAN; PARTICLE SWARM OPTIMIZATION ALGORITHM; ROUTING AND SCHEDULING;

JOB SHOP SCHEDULING;

EID: 84922120859     PISSN: 09565515     EISSN: 15728145     Source Type: Journal    
DOI: 10.1007/s10845-015-1039-3     Document Type: Article

References (39)

1. Asadzadeh, L., & Zamanifar, K. (2010). An agent-based parallel approach for the job shop scheduling problem with genetic algorithms. Mathematical and Computer Modelling, 52, 1957–1965.
2. Azzouz, A., Ennigrou, M., Jlifi, B., & Ghédira, K. (2012). Combining tabu search and genetic algorithm in a multi-agent system for solving flexible job shop problem. In Eleventh Mexican international conference on artificial intelligence, pp. 83–88.
3. Brandimarte, P. (1993). Routing and scheduling in a flexible job shop by tabu search. Annals of Operations Research., 41, 157–183.
4. Binh, H., & Cing, T. (2008). Solving multiple-objective flexible job shop problems by evolution and local search. IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews, 38(5), 674–685.
5. Bastos-Filho, C., Carvalho, D., Figueiredo, E., & Miranda, P. (2009). Dynamic clan particle swarm optimization. In Ninth international conference on intelligent systems design and applications, pp. 249–254.
6. Clerc, M., & Kennedy, J. (2002). The particle swarm explosion, stability, and convergence in a multidimensional complex space. IEEE Transactions on Evolutionary Computation, 6(1), 58–73.
7. Clerc, M. (2004). Discrete particle swarm optimization, illustrated by the traveling salesman problem. In New optimization techniques in engineering (pp. 219–239). Berlin: Springer.
8. Chen, Y., Li, Z., & Wang, Z. (2004). Multi-agent-based genetic algorithm for JSSP. In Proceedings of the third international conference on machine learning and cybernetics 2004, pp. 267–270.
9. Ennigrou, M., & Ghédira, K. (2004). Approche multi-agents basée sur la recherche tabou pour le job shop flexible. In 14ème congrès francophone de reconnaissance des formes et intelligence artificielle, Toulouse, France.
10. Ennigrou, M., & Ghédira, K. (2008). New local diversification techniques for the flexible job shop problem with a multi-agent approach. Journal of Autonomous Agents and Multi- Agent Systems, 17(2), 270–287.
11. Emin, M. (2012). Coordinating metaheuristic agents with swarm intelligence. Journal of Intelligent Manufacturing, 23(4), 991–999. doi:10.1007/s10845-010-0435-y.
12. Fernández, M., & Raupp, F. (2014). A Newton-based heuristic algorithm for multi-objective flexible job-shop scheduling problem. Journal of Intelligent Manufacturing, pp. 1–8. doi:10.1007/s10845-014-0872-0.
13. Girish, B., & Jawahar, N. (2009). A particle swarm optimization algorithm for flexible job shop scheduling problem. In 5th annual IEEE conference on automation science and engineering, Bangalore, India, pp. 298–303.
14. Gao, K. Z., Suganthan, P. N., Pan, Q. K., Chua, T. J., Cai, T. X., & Chong, C. S. (2014). Discrete harmony search algorithm for flexible job shop scheduling problem with multiple objectives. Journal of Intelligent Manufacturing, pp. 1–12.
15. Gen, M., & Lin, L. (2014). Multi-objective evolutionary algorithm for manufacturing scheduling problems: state-of-the-art survey. Journal of Intelligent Manufacturing, 25(5), 849–866. doi:10.1007/s5-013-0804-4.
16. Henchiri, A., & Enngirou, M. (2013). Particle swarm optimization combined with tabu search in a multi-agent model for flexible job shop problem. Computer Science, 7929, 385–394.
17. Jia, Z., Chen, Z., & Tang, J. (2007). An improved particle swarm optimization for multi-objective flexible job-shop scheduling problem. In: Proceedings of 2007 IEEE international conference on grey systems and intelligent services, Nanjing, China, pp. 1587–1592.
18. Jun-jie, B., Yi-guang, G., Ning-sheng, W., & Dun-bing, T. (2009). An improved PSO algorithm for flexible job shop scheduling with lot-splitting. In Intelligent systems and applications, 2009. ISA 2009. International workshop on. IEEE, 2009. pp. 1–5.
19. Jalilvand-Nejad, A., & Fattahi, P. (2013). A mathematical model and genetic algorithm to cyclic flexible job shop scheduling problem. Journal of Intelligent Manufacturing, 1–14, 1–14. doi:10.1007/s10845-013-0841-z.
20. Kennedy, J., & Eberhart, R. (1995). Particle swarm optimization. In Proceedings of IEEE international conference on neural networks, pp. 1942–1948.
21. Kennedy, J. (1999). Small worlds and mega-minds: Effects of neighborhood topology on particle swarm performance. In Evolutionary computation, vol. 3.
22. Kacem, I., Hammadi, S., & Borne, P. (2002). Approach by localization and multiobjective evolutionary optimization for flexible job-shop scheduling problems. IEEE Transactions Systems, Man, and Cybernetics, Part C: Applications and Reviews, 32(1), 1–13.
23. Kennedy, J., & Mendes, R. (2003). Neighborhood topologies in fully-informed and best-of-neighborhood particle swarms. In IEEE workshop on soft computing in industrial applications, pp. 45–50.
24. Liu, H., Abraham, A., & Grosan, C. (2007). A novel variable neighborhood particle swarm optimization for multi-objective flexible job-shop scheduling problems. Digital Information Management, 1, 138–145.
25. Li, J., Pan, Q., Xie, S., Jia, B., & Wang, Y. (2010). A hybrid particle swarm optimization and tabu search algorithm for flexible job-shop scheduling problem. International Journal of Computer Theory and Engineering, 2(2), 1793–8201.
26. Lai, P., & Wu, H. (2013). Using heuristic algorithms to solve the scheduling problems with job-dependent and machine-dependent learning effects. Journal of Intelligent Manufacturing. doi:10.1007/s10845-010-0435-y.
27. Motaghedi-larijani, A., Sabri-laghaie, K., & Heydari, M. (2010). Solving flexible job shop scheduling with multi objective approach. International Journal of Industrial Engineering & Production Research, 21(4), 197–209.
28. Meeran, S., & Morshed, M. S. (2012). A hybrid genetic tabu search algorithm for solving job shop scheduling problems: A case study. Journal of Intelligent Manufacturing, 23, 1063–1078. doi:10.1007/s10845-011-0520-x.
29. Nouiri, M., Jemai, A., Bekrar, A., Niar, S., & Ammari, A. C. (2013). An effective particle swarm optimization to solve flexible job shop scheduling problem. In Presented at the 5th IESM conference. Morocco: Rabat.
30. Pezzellaa, F., Morgantia, G., & Ciaschettib, G. (2008). Genetic algorithm for the flexible job-shop scheduling. Computers & Operations Research, 35, 3202–3212.
31. Trelea, I. (2003). The particle swarm optimization algorithm: convergence analysis and parameter selection. Information Processing Letters, 85, 317–325.
32. Tanga, J., Zhanga, G., Lina, B., & Zhang, B. (2011). A hybrid algorithm for flexible job-shop scheduling problem. Procedia Engineering, 15, 3678–3683.
33. Venter, G., & Sobieszczanski-Sobieski, J. (2006). Parallel particle swarm optimization algorithm accelerated by asynchronous evaluations. Journal of Aerospace Computing, Information, and Communication, 3(3), 123–137.
34. Wang, Y., & Xiang, Q. (2008). Particle swarms with dynamic ring topology. Evolutionary Computation, 3, 419–423.
35. Wei, X., & Dongmei, F. (2012). Multi-agent system for flexible job-shop scheduling problem based on human immune system. In Proceedings of the 31st Chinese control conference, Hefei, China, pp. 2476–2480.
36. Xia, W., & Wu, Z. (2005). An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems. Computers & Industrial Engineering, 48, 409–425.
37. Zambrano rey, G., Bekrar, A., Prabhu, V., & Trentesaux, D. (2014). Coupling a genetic algorithm with the distributed arrival-time control for the JIT dynamic scheduling of flexible job-shops. International Journal of Production Research, 52(12), 3688–3709.
38. Zhang, G., Shao, X., Li, P., & Gao, L. (2009). An effective hybrid particle swarm optimization algorithm for multi-objective flexible job-shop scheduling problem. Computers & Industrial Engineering, 56, 1309–1318.
39. Zhang, G., Gao, L., & Shi, Y. (2011). An effective genetic algorithm for the flexible job-shop scheduling problem. Expert Systems with Applications, 38, 3563–3573.