Skip to main content
SpringerLink
Log in

A scatter search approach for general flowshop scheduling problem

  • ORIGINAL ARTICLE
  • Published:
The International Journal of Advanced Manufacturing Technology Aims and scope Submit manuscript

Abstract

This paper proposes a new evolutionary technique called scatter search for scheduling problems of a general flow-shop. Scatter search (SS) is applied to this problem as it is able to provide a wide exploration of the search space through intensification and diversification. In addition it has a unifying principle for joining solutions which exploit the adaptive memory principle to avoid generating or incorporating duplicate solutions at various stages of the problem. This methodology provides substantially better results than the Tabu search approach of Nowicki and Smutnicki (Manage Sci 42(6):797–813, 1996) and Jain and Meeran (Comput Oper Res 29:1873–1901, 2002). The proposed framework achieves an average deviation of 14.25% from the lower bound solution of benchmark problems of Demirkol et al. (Eur J Oper Res 109(1):137–141, 1998), while the scatter search technique gives the best solutions for 32 of 40 of their benchmark problems.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Dudek RA, Panwalkar SS, Smith ML (1992) The lessons of flow shop scheduling research. Oper Res 40(1):7–13

    MATH  Google Scholar 

  2. Glover F, Laguna M, Marti R (2000) Fundamentals of scatter search and path relinking. Control Cybern 39(3):653–684

    MathSciNet  Google Scholar 

  3. Pinedo M (1995) Scheduling: theory algorithms and systems. Prentice-Hall, Englewood Cliffs, New Jersey

    MATH  Google Scholar 

  4. Johnson SM (1954) Optimal two and three-stage production schedule with setup times included. Nav Res Logist Q 1:61–68

    Google Scholar 

  5. Garey MR, Johnson DS, Sethi R (1976) The complexity of flowshop and jobshop scheduling. Math Oper Res 1:117–129

    MathSciNet  MATH  Google Scholar 

  6. Palmer DS (1965) Sequencing jobs through a multi-stage process in the minimum total time—a quick method of obtaining a near optimum. Oper Res Q 16(1):101–107

    MathSciNet  Google Scholar 

  7. Campbell HG, Dudek RA, Smith ML (1970) A heuristic algorithm for the n-job, m-machine sequencing problem. Manage Sci 16(B):630–637

    Google Scholar 

  8. Gupta JND (1971) A functional heuristic algorithm for the flow shop scheduling problem. Oper Res Q 22(1):39–47

    Article  MATH  Google Scholar 

  9. Colin RR (1995) A genetic algorithm for flow shop sequencing. Comput Oper Res 22:5–13

    Article  MATH  Google Scholar 

  10. Jackson JR (1955) Scheduling a production line to minimize maximum tardiness. Management science research project, UCLA

  11. Dannenbring DG (1977) An evaluation of flow shop sequencing heuristics. Manage Sci 23(11):1174–1182

    MATH  Google Scholar 

  12. Nawaz M, Enscore EE Jr, Ham I (1983) A heuristic algorithm for the m-machine, n-job flow shop sequencing problem. Int J Manage Sci 11(1):91–95

    Google Scholar 

  13. Taillard E (1990) Some efficient heuristic methods for the flow shop sequencing problem. Eur J Oper Res 47:65–74

    Article  MathSciNet  MATH  Google Scholar 

  14. Osman IH, Potts CN (1989) Simulated annealing for permutation flow shop scheduling. Int J Manage Sci 17:551–557

    Google Scholar 

  15. Widmer M, Hertz A (1989) A new heuristic for the flow shop sequencing problem. Eur J Oper Res 41:186–193

    Article  MATH  Google Scholar 

  16. Ho JC, Chang YL (1990) A new heuristic for the n-job, m-machine flow shop problem. Eur J Oper Res 52:194–206

    Article  Google Scholar 

  17. Ogbu FA, Smith DK (1990) The application of the simulated annealing algorithm to the solution of the n/m/Cmax flowshop problem. Comput Oper Res 17:243–253

    Article  MathSciNet  MATH  Google Scholar 

  18. Nowicki E, Smutnicki C (1996) A fast tabu search algorithm for the permutation flow shop problem. Eur J Oper Res 91:160–175

    Article  MATH  Google Scholar 

  19. Ben-Daya M, Al-Fawzan M (1998) A tabu search approach for the flow shop scheduling problem. Eur J Oper Res 109:88–95

    Article  MATH  Google Scholar 

  20. Jain AS, Meeran S (1999) Deterministic job-shop scheduling: past, present and future. Eur J Oper Res 113(2):390–434

    Article  MATH  Google Scholar 

  21. Nabeshima I (1971) General scheduling algorithms with applications to parallel scheduling and multiprogramming scheduling. J Oper Res Soc Jpn 14(2):72–99

    MATH  Google Scholar 

  22. Krone M, Steiglitz K (1974) Heurisitic programming solution of a flow shop scheduling problem. Oper Res 22:629–638

    MATH  Google Scholar 

  23. Rock H, Schmidt G (1983) Machine aggregation heuristics in shop-scheduling. Method Oper Res 45:303–314

    Google Scholar 

  24. Potts CN, Shmoys DB, Williamson DP (1991) Permutation vs. non-permutation flow shop schedules. Oper Res Lett 10:281–284

    Article  MathSciNet  MATH  Google Scholar 

  25. Brucker P (1998) Scheduling algorithms, 2nd edn. Springer, Berlin Heidelberg New York

    MATH  Google Scholar 

  26. Jain AS, Meeran S (2002) A multi-level hybrid framework applied to the general flow-shop scheduling problem. Comput Oper Res 29:1873–1901

    Article  Google Scholar 

  27. Vaessens RJM (1996) Operations research library of problems. Management School, Imperial College, London

    Google Scholar 

  28. Jain AS (1998) A multi-level hybrid framework for the deterministic job-shop scheduling problem. PhD thesis, Department of APEME, University Of Dundee, Dundee, Scotland, UK

  29. Glover F (1998) A template for scatter search and path relinking In: Hao J-K, Lutton E, Ronald E, Schoenauer M, Snyers D (eds) Artificial evolution. Lecture notes in computer science, vol 1363:13–54, Springer, Berlin Heidelberg New York

    Google Scholar 

  30. Demirkol E, Mehta S, Uzsoy R (1998) Benchmarks for shop scheduling problems. Eur J Oper Res 109(1):137–141

    Article  MATH  Google Scholar 

  31. Laguna M, Martí R, Campos V (1998) Intensification and diversification with elite tabu search solutions for the linear ordering problem. Comp Oper Res 26:1217–1230

    Article  Google Scholar 

  32. Nowicki E, Smutnicki C (1996) A fast taboo search algorithm for the job-shop problem. Manage Sci 42(6):797–813

    Article  MATH  Google Scholar 

  33. Demirkol E, Mehta S, Uzsoy R (1998) DMU problems. http://gilbreth.ecn.purdue.edu/∼uzsoy2/benchmark/fcmax.txt. Cited 7 December 2005

Download references

Author information

Authors and Affiliations

  1. Department of Production Engineering, National Institute of Technology, Tiruchirappalli, Tamil Nadu, India

    A. Noorul Haq, A. R. Vivekraj & T. Prasad

  2. RVS College of Engineering & Technology, Dindigul, Tamil Nadu, India

    M. Saravanan

Authors
  1. A. Noorul Haq
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. M. Saravanan
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. A. R. Vivekraj
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. T. Prasad
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to A. Noorul Haq.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Haq, A.N., Saravanan, M., Vivekraj, A.R. et al. A scatter search approach for general flowshop scheduling problem. Int J Adv Manuf Technol 31, 731–736 (2007). https://doi.org/10.1007/s00170-005-0244-1

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-005-0244-1

Keywords

Search

Navigation