Skip to main content
SpringerLink
Log in

A Particle Swarm Optimization Metaheuristic for the Blocking Flow Shop Scheduling Problem: Total Tardiness Minimization

  • Conference paper
  • First Online:
Multi-Agent Systems and Agreement Technologies (EUMAS 2015, AT 2015)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 9571))

  • 853 Accesses

Abstract

In this research, the blocking permutation flow shop problem is invoked where the Particle Swarm Optimization algorithm (PSO) is used to minimize the total tardiness criterion. Indeed, particles constructing the swarm and their corresponding velocities are encoded as a job-permutation lists. Initially, the population is formed using a new NEH heuristic version and then updated based on some fixed neighborhood search method. The computational evaluation carried out on the well-known benchmark sets of Ronconi and Henriques has shown that the proposed technique is very effective in comparison with other state-of-the-art algorithms. New best solutions for the fixed instances are reported.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Johnson, S.M.: Optimal two- and three-stage production schedules with setup time included. Nav. Res. Logistics Q. 1, 61–68 (2013)

    Article  Google Scholar 

  2. Ronconi, D.P., Henriques, L.R.S.: Some heuristic algorithms for total tardiness minimization in a flowshop with blocking. Omega 37(2), 272–281 (2009)

    Article  Google Scholar 

  3. Koulamas, C.: The total tardiness problem: review and extensions. Oper. Res. 42, 1025–1041 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  4. Davendra, D., Bialic-Davendra, M., Senkerik, R., Pluhacek, M.: Scheduling the flowshop with blocking problem with the chaos-induced discrete self organising migrating algorithm. In: Proceedings of the 27th European Conference on Modelling and Simulation, pp. 386–392 (2013)

    Google Scholar 

  5. Caraffa, V., Ianes, S., Bagchi, T.P., Sriskandarajah, C.: Minimizing makespan in a flowshop using genetic algorithms. Int. J. Prod. Econ. 2, 101–115 (2001)

    Article  Google Scholar 

  6. Deng, G., Xu, Z., Gu, X.: A discrete artificial bee colony algorithm for minimizing the total flow time in the blocking flow shop scheduling. Chin. J. Chem. Eng. 20, 1067–1073 (2012)

    Article  Google Scholar 

  7. Gilmore, P., Gomory, R.: Sequencing a one state variable machine: a solvable case of the traveling salesman problem. Oper. Res. 5, 655–679 (1964)

    Article  MathSciNet  MATH  Google Scholar 

  8. Grabowski, J., Pempera, J.: The permutation flowshop problem with blocking. a tabu search approach. Omega 3, 302–311 (2007)

    Article  Google Scholar 

  9. Baker, K.R., Bertrand, J.W.M.: An investigation of due date assignment rules with constrained tightness. J. Oper. Manage. 3, 109–120 (1984)

    Google Scholar 

  10. Graham, R., Lawler, E., Lenstra, J., Rinnooy, K.: Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann. Discrete Math. 5, 287–362 (1979)

    Article  MathSciNet  MATH  Google Scholar 

  11. Hall, N., Sriskandarajah, C.: A survey of machine scheduling problems with blocking and no-wait in process. Oper. Res. 44, 510–525 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  12. Han, Y.-Y., Liang, J., Pan, Q.-K., Li, J.-Q., Sang, H.-Y., Cao, N.: Effective hybrid discrete artificial bee colony algorithms for the total flowtime minimization in the blocking flowshop problem. Int. J. Adv. Manuf. Technol. 67, 397–414 (2013)

    Article  Google Scholar 

  13. Kennedy, J., Eberhart, R.: Particle swarm optimization. Proc. IEEE Int. Conf. Neural Netw. 4, 1942–1948 (1995)

    Article  Google Scholar 

  14. Lin, S., Ying, K.: Minimizing makespan in a blocking flowshop using a revised artificial immune system algorithm. Omega 41, 383–389 (2013)

    Article  Google Scholar 

  15. McCormick, S., Pinedo, M., Shenker, S., Wolf, B.: Sequencing in an assembly line with blocking to minimize cycle time. J. Oper. Res. 37(6), 925–935 (1989)

    Article  MATH  Google Scholar 

  16. Nawaz, M., Enscore, J., Ham, I.: A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. Omega 11, 91–95 (1983)

    Article  Google Scholar 

  17. Pan, Q., Wang, L.: Effective heuristics for the blocking flowshop scheduling problem with makespan minimization. Omega 2, 218–229 (2012)

    Article  Google Scholar 

  18. Pan, Q., Wang, L., Sang, H., Li, J., Liu, M.: A high performing memetic algorithm for the flowshop scheduling problem with blocking. IEEE Trans. Autom. Sci. Eng. 10, 741–756 (2013)

    Article  Google Scholar 

  19. Pinedo, M.: Scheduling: Theory, Algorithms, and Systems. Pretice Hall, U.A.S (2008)

    MATH  Google Scholar 

  20. Reddi, S., Ramamoorthy, C.: On the flow-shop sequencing problem with no wait in process. Oper. Res. Q. 3, 323–331 (1972)

    Article  MATH  Google Scholar 

  21. Rock, H.: Some new results in flow shop scheduling. Zeitschrift fur Oper. Res. 28, 1–16 (1984)

    MathSciNet  Google Scholar 

  22. Ronconi, D.: A branch-and-bound algorithm to minimize the makespan in a flowshop problem with blocking. Ann. Oper. Res. 1, 53–65 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  23. Tasgetiren, M., Pan, Q., Suganthan, P., Chen, A.: A discrete artificial bee colony algorithm for the total flow time minimization in permutation flow shops. Inform. Sci. 16, 3459–3475 (2011)

    Article  MathSciNet  Google Scholar 

  24. Wang, L., Pan, Q., Suganthan, P., Wang, W., Wang, Y.: A novel hybrid discrete differential evolution algorithm for blocking flowshop scheduling problems. Comput. Oper. Res. 3, 509–520 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  25. Wang, L., Pan, Q., Tasgetiren, M.: Minimizing the total flow time in a flowshop with blocking by using hybrid harmony search algorithms. Expert Syst. Appl. 12, 7929–7936 (2010)

    Article  Google Scholar 

  26. Wang, X., Tang, L.: A discrete particle swarm optimization algorithm with self-adaptive diversity control for the permutation flowshop problem with blocking. Appl. Soft Comput. 12, 652–662 (2012)

    Article  Google Scholar 

  27. Armentano, V.A., Ronconi, D.P.: Minimizaçâo do Tempo Total de Atraso No Problema de Flowshop Com Buffer Zero através de Busca Tabu. Gestao and Produçao 7(3), 352–363 (2000)

    Article  Google Scholar 

  28. Ribas, I., Companys, R., Tort-Martorell, X.: An efficient iterated local search algorithm for the total tardiness blocking flow shop problem. Int. J. Prod. Res. 51, 5238–5252 (2013)

    Article  Google Scholar 

  29. Januario, T.O., Arroyo, J.E.C., Moreira, M.C.O.: Nature Inspired Cooperative Strategies for Optimization (NICSO 2008). Springer, Heidelberg, pp. 153–164 (2009)

    Google Scholar 

  30. Potts, C.N., Van Wassenhove, L.N.: A decomposition algorithm for the single machine total tardiness problem. Oper. Res. Lett. 1, 177–181 (1982)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Ecole Supérieure des Sciences Economiques et Commerciales de Tunis, University of Tunis, Tunis, Tunisia

    Nouri Nouha

  2. College of Business, Umm Al-Qura University, Umm Al-Qura, Saudi Arabia

    Ladhari Talel

Authors
  1. Nouri Nouha
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ladhari Talel
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Nouri Nouha .

Editor information

Editors and Affiliations

  1. University of Edinburgh, Edinburgh, United Kingdom

    Michael Rovatsos

  2. Department of Digital Systems, University of Piraeus, Piraeus, Greece

    George Vouros

  3. Technical University of Valencia, Valencia, Spain

    Vicente Julian

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Nouha, N., Talel, L. (2016). A Particle Swarm Optimization Metaheuristic for the Blocking Flow Shop Scheduling Problem: Total Tardiness Minimization. In: Rovatsos, M., Vouros, G., Julian, V. (eds) Multi-Agent Systems and Agreement Technologies. EUMAS AT 2015 2015. Lecture Notes in Computer Science(), vol 9571. Springer, Cham. https://doi.org/10.1007/978-3-319-33509-4_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-33509-4_13

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-33508-7

  • Online ISBN: 978-3-319-33509-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation