IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v38y1990i5p924-928.html
   My bibliography  Save this article

Stochastic Minimization of the Makespan in Flow Shops with Identical Machines and Buffers of Arbitrary Size

Author

Listed:
  • Masaaki Kijima

    (The University of Tsukuba, Tokyo, Japan)

  • Naoki Makimoto

    (Tokyo Institute of Technology, Tokyo, Japan)

  • Hiroshi Shirakawa

    (Tokyo Institute of Technology, Tokyo, Japan)

Abstract

Stochastic permutation flow shops of m identical machines and n jobs are considered. There exist buffers of arbitrary size between two consecutive machines. For particular types of job processing times, we present optimal schedules which minimize the makespan in the stochastic sense. Moreover, it will be shown that the optimal schedules are closely related to those of the no buffer case. Finally, our results are recaptured in the context of tandem queues.

Suggested Citation

  • Masaaki Kijima & Naoki Makimoto & Hiroshi Shirakawa, 1990. "Stochastic Minimization of the Makespan in Flow Shops with Identical Machines and Buffers of Arbitrary Size," Operations Research, INFORMS, vol. 38(5), pages 924-928, October.
    • Handle: RePEc:inm:oropre:v:38:y:1990:i:5:p:924-928
    DOI: 10.1287/opre.38.5.924
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.38.5.924
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.38.5.924?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
    ---><---

    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:inm:oropre:v:38:y:1990:i:5:p:924-928. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.