Skip to main content
SpringerLink
Log in

Improved Flow Shop Schedules with Total Completion Time Criterion

  • Conference paper
Computational Science and Its Applications – ICCSA 2013 (ICCSA 2013)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7973))

Included in the following conference series:

  • 2446 Accesses

Abstract

The paper addresses the permutation flow shop scheduling problem with the minimization of the total completion time objective. Two heuristics are presented combining two note-worthy constructive heuristics. Exhaustive computational results on standard benchmark problems are presented. It is shown that the solutions generated are better than those obtained by the well - known heuristic in the literature. Statistical significance of better results produced by the proposed heuristics is also 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 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Baker, K.R.: Introduction to sequencing and scheduling. John Wiley, New York (1974)

    Google Scholar 

  2. Nawaz, M.E., Enscore, E., Ham, I.: A heuristic algorithm for the m– machine, n–job flowshop sequencing problem. Omega 11, 91–95 (1983)

    Article  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  4. Laha, D., Chakraborty, U.K.: An efficient stochastic hybrid heuristic for flowshop scheduling. Engineering Applications of Artificial Intelligence 20, 851–856 (2007)

    Article  Google Scholar 

  5. Agarwal, A., Colak, S., Eryarsoy, E.: Improvement heuristic for the flow-shop scheduling problem. European Journal of Operational Research 169, 801–815 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  6. Sarin, S., Lefoka, M.: Scheduling heuristic for the n-job m-machine flow shop. Omega 21, 229–234 (1993)

    Article  Google Scholar 

  7. Gonzalez, T., Sahni, S.: Flow shop and job shop scheduling: complexity & approximation. Operations Research 26, 36–52 (1978)

    Article  MathSciNet  MATH  Google Scholar 

  8. Gupta, J.N.D.: Heuristic algorithms for multistage flow shop problem. AIIE Transaction 4, 11–18 (1972)

    Article  Google Scholar 

  9. Ho, J.C.: Flowshop sequencing with mean flow time objective. European Journal of Operational Research 81, 571–578 (1995)

    Article  MATH  Google Scholar 

  10. Wang, C., Chu, C., Proth, J.M.: Heuristic approaches for n/m/F/(Ci scheduling problems. European Journal of Operational Research 96, 636–644 (1997)

    Article  MATH  Google Scholar 

  11. Rajendran, C., Chaudhuri, D.: An efficient heuristic approach to the scheduling of jobs in a flowshop. European Journal of Operational Research 61, 318–325 (1991)

    Article  Google Scholar 

  12. Rajendran, C.: Heuristic algorithm for scheduling in flowshop to minimize total flow time. International Journal of Production Economics 29, 65–73 (1993)

    Article  Google Scholar 

  13. Rajendran, C., Ziegler, H.: An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs. European Journal of Operational Research 103, 129–138 (1997)

    Article  MATH  Google Scholar 

  14. Woo, D.S., Yim, H.S.: A heuristic algorithm for mean flow time objective in flowshop scheduling. Computers and Operations Research 25, 175–182 (1998)

    Article  MATH  Google Scholar 

  15. Liu, J., Reeves, C.R.: Constructive and composite heuristics solution of the P ∥ ∑ C i scheduling problem. European Journal of Operational Research 132, 439–452 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  16. Framinan, J.M., Leisten, R.: An efficient constructive heuristic for flowtime minimization in permutation flowshops. Omega 31, 311–317 (2003)

    Article  Google Scholar 

  17. Laha, D., Sarin, S.C.: A heuristic to minimize total flow time in permutation flow shop. Omega 37, 734–739 (2009)

    Article  Google Scholar 

  18. Laha, D., Chakravorty, A.: A new heuristic for minimizing total completion time objective in permutation flow shop scheduling. International Journal of Advanced Manufacturing Technology 53, 1189–1197 (2010)

    Article  Google Scholar 

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

    Article  MATH  Google Scholar 

  20. Kreyszig, E.: Advanced Engineering Mathematics. John Wiley, New York (1972)

    MATH  Google Scholar 

  21. Taillard, E.: Some efficient heuristic methods for the flow shop sequencing problem. European Journal of Operational Research 47, 65–74 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  22. Li, X., Wang, Q., Wu, C.: Efficient composite heuristics for total flowtime minimization in permutation flowshops. Omega 37, 155–164 (2009)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mechanical Engineering Department, Jadavpur University, Kolkata, 700032, India

    Dipak Laha & Dhiren Kumar Behera

Authors
  1. Dipak Laha
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dhiren Kumar Behera
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. L-I.S.U.T. - D.A.P.I.t. Facoltà Ingegneria, Università degli Studi della Basilicata, Viale dell’Ateneo Lucano, 10, 85100, Potenza, Italy

    Beniamino Murgante

  2. Covenant University, Canaanland, Ota, Nigeria

    Sanjay Misra

  3. Partimento di Scienze e Tecnologie per LAgricoltura, le Foreste, la Natura e lEnergia, Università degli Studi della Tuscia, Via S. Camillo de Lellis, snc, 01100, Viterbo, Italy

    Maurizio Carlini

  4. Dipartimento di Scienze dell’Ingegneria Civile e dell’Architecttura, Politecnico di Bari, Via Orabona, 4, 70125, Bari, Italy

    Carmelo M. Torre

  5. International University VNU-HCM, Quarter 6, Linh Trung, Thu Duc, Ho Chi Minh City, Vietnam

    Hong-Quang Nguyen

  6. School of Business Systems, Monash University, 3800, Clayton, VIC, Australia

    David Taniar

  7. Department of Intelligent Informatics, Kyushu Sangyo University, 2-3-1 Matsukadai, Higashi-ku, 813-8503, Fukuoka, Japan

    Bernady O. Apduhan

  8. Department of Mathematics and Computer Science, University of Perugia, Via Vanvitelli, 1, 06123, Perugia, Italy

    Osvaldo Gervasi

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Laha, D., Behera, D.K. (2013). Improved Flow Shop Schedules with Total Completion Time Criterion. In: Murgante, B., et al. Computational Science and Its Applications – ICCSA 2013. ICCSA 2013. Lecture Notes in Computer Science, vol 7973. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39646-5_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-39646-5_19

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-39645-8

  • Online ISBN: 978-3-642-39646-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation