IDEAS home Printed from https://ideas.repec.org/a/wly/navlog/v23y1976i2p235-243.html
   My bibliography  Save this article

Optimal flowshop schedules with no intermediate storage space

Author

Listed:
  • Jatinder N. D. Gupta

Abstract

In this paper the problem of finding an optimal schedule for the n‐job, M‐machine flowshop scheduling problem is considered when there is no intermediate space to hold partially completed jobs and the objective function is to minimize the weighted sum of idle times on all machines. By assuming that jobs are processed as early as possible, the problem is modeled as a traveling salesman problem and solved by known solution techniques for the traveling salesman problem. A sample problem is solved and a special case, one involving only two machines, is discussed.

Suggested Citation

  • Jatinder N. D. Gupta, 1976. "Optimal flowshop schedules with no intermediate storage space," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 23(2), pages 235-243, June.
    • Handle: RePEc:wly:navlog:v:23:y:1976:i:2:p:235-243
    DOI: 10.1002/nav.3800230206
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.3800230206
    Download Restriction: no
    File URL: https://libkey.io/10.1002/nav.3800230206?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wly:navlog:v:23:y:1976:i:2:p:235-243. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1931-9193 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.