Skip to main content
SpringerLink
Log in

A Heuristic for Permutation Flowshop Scheduling to Minimize Makespan

  • Conference paper
  • First Online:
Proceedings of the Third International Conference on Soft Computing for Problem Solving

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 259))

Abstract

As the problem related to minimizing makespan as objective is NP-hard for more than two machines in flowshop scheduling, therefore need for heuristics have been felt to yield optimal or near optimal solutions in polynomial time. In the present paper, we propose an alternative heuristic algorithm which is compared with the benchmark Palmer’s, CDS and NEH algorithm for the processing of n-jobs through m-machines. The proposed heuristic gives solution for solving n-job and m-machine flowshop scheduling problem with minimizing makespan as criteria. Comparisons have been made for tested instances.

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 259.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 329.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. Baker, K.R.: Introduction to Sequencing and Scheduling. Wiley, New York (1974)

    Google Scholar 

  2. Bestwick, P.F., Hastings, N.A.J.: A new bound for machine scheduling. Oper. Res. Q. 27, 479–487 (1976)

    Article  MathSciNet  Google Scholar 

  3. Bonney, M.C., Gundry, S.W.: Solutions to the constrained flowshop sequencing problem. Oper. Res. Q. 27, 869–883 (1976)

    Article  MATH  Google Scholar 

  4. Campbell, H.G., Dudek, R.A., Smith, M.L.: A heuristic algorithm for n-jobs, m-machine sequencing problem. Manage. Sci. 16, 630–637 (1970)

    Article  Google Scholar 

  5. Chakraborty, U.K., Laha, D.: An improved heuristic for permutation flowshop scheduling. Int. J. Inf. Commun. Technol. 1, 89–97 (2007)

    Article  Google Scholar 

  6. Conway, R.W., Maxwell, W.L., Miller, L.W.: Theory of Scheduling. Addison-Wesley, Reading (1967)

    MATH  Google Scholar 

  7. Dannenbring, D.G.: An evaluation of flowshop sequencing heuristics. Manage. Sci. 23, 1174–1182 (1977)

    Article  MATH  Google Scholar 

  8. Framinan, J.M., Gupta, J.N.D., Leisten, R.: A review and classification of heuristics for permutation flow-shop scheduling with makespan objective. J. Oper. Res. Soc. 55, 1243–1255 (2004)

    Article  MATH  Google Scholar 

  9. Garey, M.R.D., Johnson, D.S., Sethi, R.: The complexity of flow shop and job shop scheduling. Math. Oper. Res. 1, 117–129 (1976)

    Article  MATH  MathSciNet  Google Scholar 

  10. Grabowski, J., Wodecki, M.: A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion. Comput. Oper. Res. 31, 1891–1909 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  11. Graham, R.L., Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G.: Optimisation and approximation in deterministic sequencing and scheduling: a survey. Ann. Discret. Math. 5, 287–326 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  12. Gupta, J.N.D.: A functional heuristic for the flow-shop scheduling problem. Oper. Res. Q. 22, 39–47 (1971)

    Article  MATH  Google Scholar 

  13. Gupta, J.N.D.: A heuristic algorithm for the flow shop scheduling problem. R.A.I.R.O. Rech. Operationnelle 10, 63–73 (1976)

    MATH  Google Scholar 

  14. Ignall, E., Scharge, L.: Application of the branch and bound technique to some flow shop scheduling problems. Oper. Res. 13, 400–412 (1965)

    Article  Google Scholar 

  15. Johnson, S.M.: Optimal two- and three-stage production schedules with setup times included. Naval Res Logistics Q. 1, 61–68 (1954)

    Article  Google Scholar 

  16. Kalczynski, P.J., Kamburowski, J.: On NEH heuristic for minimizing the makespan in permutation flowshops. OMEGA, Int. J. Manage. Sci. 35, 53–60 (2007)

    Article  Google Scholar 

  17. Kalczynski, P.J., Kamburowski, J.: An improved NEH heuristic to minimize makespan in permutation flow shops. Comput. Oper. Res. 35, 3001–3008 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  18. King, J.R., Spachis, A.S.: Heuristics for flowshop scheduling. Int. J. Prod. Res. 18, 345–357 (1980)

    Article  Google Scholar 

  19. Lomnicki, Z.A.: A branch and bound algorithm for the exact solution to some flow shop scheduling problems. Oper. Res. Q. 16, 89–100 (1965)

    Article  Google Scholar 

  20. Nawaz, M., Enscore Jr., E.E., Ham, L.: A heuristic algorithm for the m machine, n job flow shop sequencing problem. OMEGA, Int. J. Manage. Sci. 11, 91–95 (1983)

    Article  Google Scholar 

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

    Article  MATH  Google Scholar 

  22. Page, E.S.: An approach to the scheduling of jobs on machines. J. Roy. Stat. Soc. 23, 484–492 (1961)

    MathSciNet  Google Scholar 

  23. Palmer, D.S.: Sequencing jobs through a multi-stage process in the minimum total time-A quick method of obtaining a near optimum. Oper. Res. Q. 16, 101–107 (1965)

    Article  Google Scholar 

  24. Park, Y.B., Pegden, C.D., Enscore, E.E.: A survey and evaluation of static flowshop scheduling heuristics. Int. J. Prod. Res. 22, 127–141 (1984)

    Article  MATH  Google Scholar 

  25. Pinedo, M.: Scheduling: Theory, Algorithms, and Systems. Prentice-Hall, Upper Saddle (2002)

    Google Scholar 

  26. Rajendran, C., Ziegler, H.: Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs. Eur. J. Oper. Res. 155, 426–438 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  27. Reeves, C.R.: A genetic algorithm for flowshop sequencing. Comput. Oper. Res. 22, 5–13 (1995)

    Article  MATH  Google Scholar 

  28. Ruiz, R., Maroto, C.: A comprehensive review and evaluation of permutation flow shop heuristics. Eur. J. Oper. Res. 165, 479–494 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  29. Taillard, E.: Benchmarks for basic scheduling problems. Eur. J. Oper. Res. 64, 278–285 (1993)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. M. M. University, Mullana, Ambala, Haryana, India

    Deepak Gupta

  2. A. P. J. College of Fine Arts, Jalandhar, Punjab, India

    Kewal Krishan Nailwal

  3. D. A. V. College, Jalandhar, Punjab, India

    Sameer Sharma

Authors
  1. Deepak Gupta
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kewal Krishan Nailwal
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Sameer Sharma
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Deepak Gupta .

Editor information

Editors and Affiliations

  1. Department of Paper Technology, Indian Institute of Technology Roorkee, Roorkee, Uttarakhand, India

    Millie Pant

  2. Department of Mathematics, Indian Institute of Technology Roorkee, Roorkee, Uttarakhand, India

    Kusum Deep

  3. Department of Mathematics and Computer Science, Liverpool Hope University, Liverpool, United Kingdom

    Atulya Nagar

  4. Department of Applied Mathematics, South Asian University, New Delhi, India

    Jagdish Chand Bansal

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer India

About this paper

Cite this paper

Gupta, D., Nailwal, K.K., Sharma, S. (2014). A Heuristic for Permutation Flowshop Scheduling to Minimize Makespan. In: Pant, M., Deep, K., Nagar, A., Bansal, J. (eds) Proceedings of the Third International Conference on Soft Computing for Problem Solving. Advances in Intelligent Systems and Computing, vol 259. Springer, New Delhi. https://doi.org/10.1007/978-81-322-1768-8_38

Download citation

  • DOI: https://doi.org/10.1007/978-81-322-1768-8_38

  • Published:

  • Publisher Name: Springer, New Delhi

  • Print ISBN: 978-81-322-1767-1

  • Online ISBN: 978-81-322-1768-8

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation