Skip to main content
SpringerLink
Log in

On the Flow-Shop Sequencing Problem with No Wait in Process†

  • Theoretical Paper
  • Published:
Journal of the Operational Research Society

Abstract

The optimization problem of minimizing the completion time in flow-shop sequencing with an environment of no intermediate storage is considered. Application of this problem in computer systems is pointed out and techniques are developed to solve the problem.

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

Author information

Authors and Affiliations

  1. Department of Electrical Engineering, The University of Texas at Austin, Texas, U.S.A.

    S. S. Reddi & C. V. Ramamoorthy

Authors
  1. S. S. Reddi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. C. V. Ramamoorthy
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Reddi, S., Ramamoorthy, C. On the Flow-Shop Sequencing Problem with No Wait in Process†. J Oper Res Soc 23, 323–331 (1972). https://doi.org/10.1057/jors.1972.52

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1057/jors.1972.52

Search

Navigation