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

Masaaki Kijima, Naoki Makimoto and Hiroshi Shirakawa
Additional contact information
Masaaki Kijima: The University of Tsukuba, Tokyo, Japan
Naoki Makimoto: Tokyo Institute of Technology, Tokyo, Japan
Hiroshi Shirakawa: Tokyo Institute of Technology, Tokyo, Japan

Operations Research, 1990, vol. 38, issue 5, 924-928

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.

Keywords: production/scheduling: stochastic minimization of the makespan; programming; stochastic: minimization of the makespan in flow shops (search for similar items in EconPapers)
Date: 1990
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.38.5.924 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:38:y:1990:i:5:p:924-928

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().