Skip to main content
SpringerLink
Log in

Flowshop/No-idle Scheduling to Minimize Total Elapsed Time

  • Published:
Journal of Global Optimization Aims and scope Submit manuscript

Abstract

This paper studies four n-job, m-machine flowshop problems when processing times of jobs on various machines follow certain conditions. The objective is to obtain a sequence, which minimizes total elapsed time under no-idle constraint. Under no-idle constraint, the machines work continuously without idle-interval. We prove two theorems. We introduce simple algorithms without using branch and bound technique. Numerical examples are also given to demonstrate the algorithms.

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. I. Adiri D. Pohoryles (1982) ArticleTitleFlowshop/no idle or no wait scheduling to minimize the sum of completion times Naval Research Logistic Quarterly 29 495–504

    Google Scholar 

  2. P.C. Bagga B. Ambika (1997) ArticleTitleSequencing with restrictions in processing times Opsearch 34 IssueID2 116–127

    Google Scholar 

  3. P.C. Bagga N.K. Chakravarti (1968) ArticleTitleOptimal m-stage production schedule CORS Journal 6 61–78

    Google Scholar 

  4. R.A. Dudek O.F. Teuton (1964) ArticleTitleDevelopment of m-stage decision rule for scheduling n jobs through m machines Operations Research 12 471–497

    Google Scholar 

  5. J.‘N.D. Gupta (1969) ArticleTitleA general algorithm for the n×m flowshop scheduling problem The International Journal of Production Research 7 241–247

    Google Scholar 

  6. S.M. Johnson (1954) ArticleTitleOptimal two and three stage production schedule with set up times included Naval Research Logistic Quarterly 1 61–68 Occurrence Handle10.1002/nav.3800010110

    Article  Google Scholar 

  7. L. Narain P.C. Bagga (2003) ArticleTitleMinimize total elapsed time subject to zero total idle time of machines in n×3 flowshop problem Indian Journal of Pure & Applied Mathematics 34 IssueID2 219–228

    Google Scholar 

  8. S.S. Panwalker A.W. Khan (1975) ArticleTitleAn improved branch and bound procedure for the n×m flowshop problems Naval Research Logistic Quarterly 22 787–790

    Google Scholar 

  9. R.D. Smith R.A. Dudek (1967) ArticleTitleA general algorithm for solution of n jobs m machines sequencing problems of the flowshop Operations Research 15 71–82 Occurrence Handle10.1287/opre.15.1.71

    Article  Google Scholar 

  10. W. Szwarc (1977) ArticleTitleSpecial cases of the flowshop problem Naval Research Logistic Quarterly 24 483–492

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, University of Delhi, Delhi, India

    Laxmi Narain

  2. Moti Lal Nehru College (E), University of Delhi, Delhi, India

    P. C. Bagga

Authors
  1. Laxmi Narain
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. P. C. Bagga
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Laxmi Narain.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Narain, L., Bagga, P.C. Flowshop/No-idle Scheduling to Minimize Total Elapsed Time. J Glob Optim 33, 349–367 (2005). https://doi.org/10.1007/s10898-004-1848-y

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10898-004-1848-y

Keywords

Mathematics Subject Classification (1991)

Search

Navigation