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

DOI10.1287/opre.38.5.924zbMath0723.90037OpenAlexW1973052636MaRDI QIDQ5202021

Masaaki Kijima, Hiroshi Shirakawa, Naoki Makimoto

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

zbMATH Keywords

tandem queuesmakespanidentical machinesbuffers of arbitrary sizeStochastic permutation flow shops

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Queues and service in operations research (90B22)

Related Items (2)

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

This page was built for publication: Stochastic Minimization of the Makespan in Flow Shops with Identical Machines and Buffers of Arbitrary Size