Stochastic Minimization of the Makespan in Flow Shops with Identical Machines and Buffers of Arbitrary Size
From MaRDI portal
Publication:5202021
DOI10.1287/opre.38.5.924zbMath0723.90037MaRDI QIDQ5202021
Masaaki Kijima, Naoki Makimoto, Hiroshi Shirakawa
Publication date: 1990
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.38.5.924
tandem queues; makespan; identical machines; buffers of arbitrary size; Stochastic permutation flow shops
90B35: Deterministic scheduling theory in operations research
90B22: Queues and service in operations research
Related Items
Scheduling in stochastic flowshops with independent setup, processing and removal times, Determining the optimal sequences and the distributional properties of their completion times in stochastic flow shops