Skip to main content
SpringerLink
Log in

A Discrete Particle Swarm Optimization Algorithm for the Permutation Flowshop Sequencing Problem with Makespan Criterion

  • Conference paper
Research and Development in Intelligent Systems XXIII (SGAI 2006)

Abstract

In this paper, a discrete particle swarm optimization (DPSO) algorithm is presented to solve the permutation flowshop sequencing problem with the makespan criterion. A new crossover operator, here we call it the PTL crossover operator, is presented. In addition, the DPSO algorithm is hybridized with a simple local search algorithm based on an insert neighborhood to further improve the solution quality. The performance of the proposed DPSO algorithm is tested on the well-known standard benchmark suite of Taillard with the best known upper bounds as of April 2004. The computational experiments show that the proposed DPSO algorithm is either better or very competitive to all the existing approaches in the literature.

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 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S.M. Johnson, Optimal two-and three-stage production schedules, Naval Research Logistics Quarterly 1 (1954) 61–68.

    Article  Google Scholar 

  2. A.H.G. Rinnooy Kan, Machine Scheduling Problems: Classification, Complexity, and Computations, Nijhoff, The Hague, (1976).

    Google Scholar 

  3. D.S. Palmer, Sequencing jobs through a multistage process in the minimum total time: A quick method of obtaining a near-optimum, Operational Research Quarterly 16(1965) 101-107.

    Google Scholar 

  4. H.G. Campbell, R.A. Dudek, M.L. Smith, A heuristic algorithm for the n job, m machine sequencing problem, Management Science 16(10) (1970) B630–B637.

    Article  Google Scholar 

  5. D.G. Dannenbring, An evaluation of flow shop sequencing heuristics, Management Science 23(11) (1977) 1174–1182.

    Article  MATH  Google Scholar 

  6. M. Nawaz, E.E. Enscore Jr., I. Ham, A heuristic algorithm for the m-machine, n-job flow shop sequencing problem, OMEGA 11(1) (1983) 91–95.

    Article  Google Scholar 

  7. E. Taillard, Some efficient heuristic methods for the flowshop sequencing problems, European Journal of Operational Research 47 (1990) 65–74.

    Article  MATH  MathSciNet  Google Scholar 

  8. J.M. Framinan, R. Leisten, An efficient constructive heuristic for flowtime minimisation in permutation flow shops, OMEGA 31 (2003) 311–317.

    Article  Google Scholar 

  9. J.M. Framinan, R. Leisten, R. Ruiz-Usano, Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation, European Journal of Operational Research 141 (2002) 559–569.

    Article  MATH  Google Scholar 

  10. I. Osman, C. Potts, Simulated annealing for permutation flow shop scheduling. OMEGA 17(6) (1989) 551–557.

    Article  Google Scholar 

  11. F. Ogbu, D. Smith, The application of the simulated annealing algorithm to the solution of the n/m/Cmax flowshop problem, Computers and Operations Research 17(3) (1990) 243–253.

    Article  MATH  MathSciNet  Google Scholar 

  12. M. Widmer, A. Hertz., A new heuristic method for the flow shop sequencing problem, European Journal of Operational Research 20(7) (1989) 707–722.

    Google Scholar 

  13. C. Reeves, Improving the efficiency of tabu search for machine sequencing problem, Journal of the Operational Research Society 44(4) (1993) 375–382.

    MATH  Google Scholar 

  14. J. Grabowski, M. Wodecki, A very fast tabu search algorithm for the permutation flowshop problem with makespan criterion, Computers and Operations Research, 31(11) (2004) 1891–1909.

    Article  MATH  MathSciNet  Google Scholar 

  15. E. Nowicki, C. Smutnicki, A fast tabu search algorithm for the permutation flowshop problem, European Journal of Operational Research 91 (1996) 160–175.

    Article  MATH  Google Scholar 

  16. C. Reeves, A genetic algorithm for flowshop sequencing, Computers and Operations Research 22(1) (1995) 5–13.

    Article  MATH  Google Scholar 

  17. C. Reeves, T. Yamada, Genetic algorithms, path relinking and the flowshop sequencing problem, Evolutionary Computation 6 (1998) 45–60.

    Article  Google Scholar 

  18. C. L. Chen, V. S. Vempati, N. Aljaber, An application of Genetic algorithms for flow shop problems, European Journal of Operational Research 80(2) (1995) 389–396.

    Article  Google Scholar 

  19. T. Aldowaisan, A. Allahverdi, New heuristics for no-wait flowshops to minimize makespan, Computers and Operations Research 30(8) (2003) 1219–1231.

    Article  MATH  Google Scholar 

  20. T. Murata, H. Ishibuchi, H. Tanaka, Genetic algorithms for flowshop scheduling problems, Computers and Industrial Engineering 30(4) (1996) 1601–1071.

    Google Scholar 

  21. C. Rajendran, H. Ziegler, Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs, European Journal of Operational Research 155(2) (2004) 426–438.

    Article  MATH  MathSciNet  Google Scholar 

  22. T. Stutzle, An ant approach to the flowshop problem, In: Proceedings of the 6th European Congress on Intelligent Techniques and Soft Cmputing (EUFIT’98), Verlag Mainz, Aachen, Germany, (1998) 1560–1564.

    Google Scholar 

  23. T. Stutzle, Applying iterated local search to the permutation flowshop problem. Technical Report, AIDA-98-04, Darmstad University of Technology, Computer Science Department, Intellctics Group, Darmstad, Germany, (1998).

    Google Scholar 

  24. M.F. Tasgetiren, M. Sevkli, Y.C. Liang, and G. Gencyilmaz, Particle swarm optimization algorithm for permutation flowshop sequencing problem, In: Proceedings of the 4th International Workshop on Ant Colony Optimization and Swarm Intelligence (ANTS2004), LNCS 3172, Brussels, Belgium, (2004) 382–390.

    Google Scholar 

  25. M.F. Tasgetiren, Y.C. Liang, M. Sevkli, G. Gencyilmaz, Particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem, European Journal of Operational Research, in press (2006).

    Google Scholar 

  26. C.-J. Liao, C.-T. Tseng, P. Luarn, A discrete version of particle swarm optimization for flowshop scheduling problems, Computers and Operations Research, in press.

    Google Scholar 

  27. R. Ruiz, C. Maroto, J. Alcaraz, Two new robust genetic algorithms for the flowshop scheduling problems, OMEGA 34 (2006) 461–476.

    Article  Google Scholar 

  28. R. Ruiz, T. Stutzle, A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem, European Journal of Operational Research. in press (2006).

    Google Scholar 

  29. E. Taillard, Benchmarks for basic scheduling problems, European Journal of Operational Research 64 (1993) 278–285.

    Article  MATH  Google Scholar 

  30. R.C. Eberhart and J. Kennedy, A new optimizer using particle swarm theory, In: Proceed-ings of the Sixth International Symposium on Micro Machine and Human Science, Nagoya, Japan, (1995) 39–43.

    Google Scholar 

  31. J. Kennedy, R.C. Eberhart, and Y. Shi, Swarm Intelligence, San Mateo, Morgan Kaufmann, CA, USA, (2001).

    Google Scholar 

  32. Q.K. Pan, M.F. Tasgetiren, and Y.C. Liang, A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem with makespan criterion, In: Proceedings of the International Workshop on UK Planning and Scheduling Special Interest Group (PLANSIG2005), City University, London, UK, (2005) 34–43.

    Google Scholar 

  33. Q.K. Pan, M.F. Tasgetiren, and Y.C. Liang, A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem with makespan and total flowtime criteria, (Under review by Computers and Operations Research).

    Google Scholar 

  34. Q.K. Pan, M.F. Tasgetiren, and Y.C. Liang, A discrete particle swarm optimization algorithm for the single-machine total weighted earliness and tardiness penalties with a com-mon due date, In: Proceeding of the World Congress on Evolutionary Computation (CEC06), accepted (2006).

    Google Scholar 

  35. Q.K. Pan, M.F. Tasgetiren, and Y.C. Liang, Minimizing total earliness and tardiness penalties with a common due date on single machine using a discrete particle swarm optimization algorithm, In: Proceedings of the 5th International Workshop on Ant Colony Optimization and Swarm Intelligence (ANTS2006), Accepted (2006).

    Google Scholar 

  36. E. Taillard, Summary of best known lower and upper bounds of Taillard’s instances. Available in http:// ina2.eivd.ch/ collaborateurs/ etd/ problemes.dir/ ordonnancement.dir/ ordonnancement.html

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. College of Computer Science, Liaocheng University, Liaocheng, China

    Quan-Ke Pan

  2. Department of Operations Management and Business Statistics, Sultan Qaboos University, P.O. Box 20, Al Khod 123, Muscat, Sultanate of Oman

    M. Fatih Tasgetiren

  3. Department of Industrial Engineering and Management, Yuan Ze University, Taiwan

    Yun-Chia Liang

Authors
  1. Quan-Ke Pan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. M. Fatih Tasgetiren
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yun-Chia Liang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Technology, University of Portsmouth, Portsmouth, UK

    Max Bramer BSc, PhD, CEng, FBCS, FIEE, FRSA

  2. Department of Computer Science, University of Liverpool, Liverpool, UK

    Frans Coenen PhD

  3. Department of Computing, City University, London

    Andrew Tuson MA, MSc, PhD, MBCS

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag London Limited

About this paper

Cite this paper

Pan, QK., Fatih Tasgetiren, M., Liang, YC. (2007). A Discrete Particle Swarm Optimization Algorithm for the Permutation Flowshop Sequencing Problem with Makespan Criterion. In: Bramer, M., Coenen, F., Tuson, A. (eds) Research and Development in Intelligent Systems XXIII. SGAI 2006. Springer, London. https://doi.org/10.1007/978-1-84628-663-6_2

Download citation

  • DOI: https://doi.org/10.1007/978-1-84628-663-6_2

  • Publisher Name: Springer, London

  • Print ISBN: 978-1-84628-662-9

  • Online ISBN: 978-1-84628-663-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation