Advertisement

Performance Evaluation of Particles Coding in Particle Swarm Optimization with Self-adaptive Parameters for Flexible Job Shop Scheduling Problem

  • Rim ZarroukEmail author
  • Abderrazak Jemai
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10868)

Abstract

The metaheuristic Particle Swarm Optimization (PSO) is well suited to solve the Flexible Job Shop Scheduling Problem (FJSP), and a suitable particle representation should importantly impact the optimization results and performance of this algorithm. The chosen representation has a direct impact on the dimension and content of the solution space. In this paper, we intend to evaluate and compare the performance of two different variants of PSO with different particle representations (PSO with Job-Machine coding Scheme (PSO-JMS) and PSO with Only-Machine coding Scheme (PSO-OMS)) for solving FJSP. These procedures have been tested on thirteen benchmark problems, where the objective function is to minimize the makespan and total workload and to compare the run time of the different PSO variants. Based on the experimental results, it is clear that PSO-OMS gives the best performance in solving all benchmark problems.

Keywords

Flexible Job Shop Problem Particle swarm optimization Scheduling Particle coding PSO performance 

References

  1. 1.
    Bonyadi, M.R., Michalewicz, Z.: A locally convergent rotationally invariant particle swarm optimization algorithm. Swarm Intell. 8(3), 159–198 (2014)CrossRefGoogle Scholar
  2. 2.
    Bonyadi, M.R., Michalewicz, Z.: Particle swarm optimization for single objective continuous space problems: a review (2017)Google Scholar
  3. 3.
    Brandimarte, P.: Routing and scheduling in a flexible job shop by tabu search. Ann. Oper. Res. 41(3), 157–183 (1993)CrossRefGoogle Scholar
  4. 4.
    Chaudhry, I.A., Khan, A.A.: A research survey: review of flexible job shop scheduling techniques. Int. Trans. Oper. Res. 23(3), 551–591 (2016)MathSciNetCrossRefGoogle Scholar
  5. 5.
    Gao, L., Peng, C.Y., Zhou, C., Li, P.G.: Solving flexible job shop scheduling problem using general particle swarm optimization. In: Proceedings of the 36th CIE Conference on Computers & Industrial Engineering, pp. 3018–3027 (2006)Google Scholar
  6. 6.
    Gao, Y., Du, W., Yan, G.: Selectively-informed particle swarm optimization. Sci. Rep. 5 (2015)Google Scholar
  7. 7.
    Genova, K., Kirilov, L., Guliashki, V.: A survey of solving approaches for multiple objective flexible job shop scheduling problems. Cybern. Inf. Technol. 15(2), 3–22 (2015)MathSciNetGoogle Scholar
  8. 8.
    Girish, B.S., Jawahar, N.: A particle swarm optimization algorithm for flexible job shop scheduling problem. In: IEEE International Conference on Automation Science and Engineering, CASE 2009, pp. 298–303. IEEE (2009)Google Scholar
  9. 9.
    Huang, S., Tian, N., Wang, Y., Ji, Z.: Multi-objective flexible job-shop scheduling problem using modified discrete particle swarm optimization. SpringerPlus 5(1), 1432 (2016)CrossRefGoogle Scholar
  10. 10.
    Kacem, I., Hammadi, S., Borne, P.: Approach by localization and multiobjective evolutionary optimization for flexible job-shop scheduling problems. IEEE Trans. Syst. Man Cybern. Part C (Applications and Reviews), 32(1), 1–13 (2002)Google Scholar
  11. 11.
    Li, X., Gao, L.: An effective hybrid genetic algorithm and tabu search for flexible job shop scheduling problem. Int. J. Prod. Econ. 174, 93–110 (2016)CrossRefGoogle Scholar
  12. 12.
    Moslehi, G., Mahnam, M.: A pareto approach to multi-objective flexible job-shop scheduling problem using particle swarm optimization and local search. Int. J. Prod. Econ. 129(1), 14–22 (2011)CrossRefGoogle Scholar
  13. 13.
    Singh, M.R., Mahapatra, S.S.: A quantum behaved particle swarm optimization for flexible job shop scheduling. Comput. Industr. Eng. 93, 36–44 (2016)CrossRefGoogle Scholar
  14. 14.
    Singh, M.R., Mahapatra, S.S., Mishra, R.: Robust scheduling for flexible job shop problems with random machine breakdowns using a quantum behaved particle swarm optimisation. Int. J. Serv. Oper. Manage. 20(1), 1–20 (2014)Google Scholar
  15. 15.
    Tang, J., Zhang, G., Lin, B., Zhang, B.: A hybrid algorithm for flexible job-shop scheduling problem. Procedia Eng. 15, 3678–3683 (2011)CrossRefGoogle Scholar
  16. 16.
    Wang, Y.M., Yin, H.L., Qin, K.D.: A novel genetic algorithm for flexible job shop scheduling problems with machine disruptions. Int. J. Adv. Manuf. Technol. 68, 1317–1326 (2013)Google Scholar
  17. 17.
    Yang, Q., Tian, J., Si, W.: An improved particle swarm optimization based on difference equation analysis. J. Differ. Equ. Appl. 23(1–2), 135–152 (2017)MathSciNetCrossRefGoogle Scholar
  18. 18.
    Zhang, L., Tang, Y., Hua, C., Guan, X.: A new particle swarm optimization algorithm with adaptive inertia weight based on Bayesian techniques. Appl. Soft Comput. 28, 138–149 (2015)CrossRefGoogle Scholar

Copyright information

© Springer International Publishing AG, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Polytechnic SchoolUniversity of CarthageLa MarsaTunisia
  2. 2.LR-NOCCS, National Engineering School of SousseUniversity of SousseSousseTunisia
  3. 3.Faculty of Sciences of TunisUniversity of Tunis El ManarTunisTunisia

Personalised recommendations