Advertisement

Simulation-Based Comparison of P-Metaheuristics for FJSP with and Without Fuzzy Processing Time

  • Zarrouk RimEmail author
  • Bennour Imed
  • Jemai Abderrazek
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10868)

Abstract

The population based metaheuristic (P-metaheuristic) is a stochastic algorithm for optimization. This paper presents five different P-metaheuristics (BAT, Firefly, Cuckoo search, basic Particle swarm optimization (BPSO) and a modified PSO (M-PSO)) for solving Flexible Job Shop Problem with and without fuzzy processing time (FJSP/fFJSP). We intend to evaluate and compare the performance of these different algorithms by using thirteen benchmarks for FJSP and four benchmarks for fFJSP. The results demonstrate the superiority of the M-PSO algorithm over the other techniques to solve both FJSP and fFJSP.

Keywords

Flexible job shop scheduling problem Particle swarm optimization Population based metaheuristics Fuzzy processing time 

References

  1. 1.
    Al-Obaidi, A.T.S., Hussein, S.A.: Two improved cuckoo search algorithms for solving the flexible job-shop scheduling problem. Int. J. Perceptive Cogn. Comput. 2(2), 25–31 (2016)Google Scholar
  2. 2.
    Brandimarte, P.: Routing and scheduling in a flexible job shop by tabu search. Ann. Oper. Res. 41(3), 157–183 (1993).  https://doi.org/10.1007/BF02023073CrossRefzbMATHGoogle Scholar
  3. 3.
    Huang, S., Tian, N., Wang, Y., Ji, Z.: An improved version of discrete particle swarm optimization for flexible job shop scheduling problem with fuzzy processing time. Math. Probl. Eng. 2016 (2016)Google Scholar
  4. 4.
    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 Appl. Rev. 32(1), 1–13 (2002)CrossRefGoogle Scholar
  5. 5.
    Karthikeyan, S., Asokan, P., Nickolas, S., Page, T.: A hybrid discrete firefly algorithm for solving multi-objective flexible job shop scheduling problems. Int. J. Bio-Inspired Comput. 7(6), 386–401 (2015)CrossRefGoogle Scholar
  6. 6.
    Lei, D.: A genetic algorithm for flexible job shop scheduling with fuzzy processing time. Int. J. Prod. Res. 48(10), 2995–3013 (2010)CrossRefGoogle Scholar
  7. 7.
    Lei, D.: Co-evolutionary genetic algorithm for fuzzy flexible job shop scheduling. Appl. Soft Comput. 12(8), 2237–2245 (2012)CrossRefGoogle Scholar
  8. 8.
    Niu, Q., Jiao, B., Xingsheng, G.: Particle swarm optimization combined with genetic operators for job shop scheduling problem with fuzzy processing time. Appl. Math. Comput. 205(1), 148–158 (2008)MathSciNetzbMATHGoogle Scholar
  9. 9.
    Xia, W., Zhiming, W.: An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems. Comput. Ind. Eng. 48(2), 409–425 (2005)CrossRefGoogle Scholar
  10. 10.
    Xu, H., Bao, Z.R., Zhang, T.: Solving dual flexible job-shop scheduling problem using a bat algorithm. Adv. Prod. Eng. Manag. 12(1), 5 (2017)MathSciNetGoogle 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