Computationally efficient approximations for balanced flowlines with finite intermediate buffers

DOI10.1080/00207549008942719zbMath0684.90047OpenAlexW2132226757MaRDI QIDQ4735021

A. G. de Kok

Publication date: 1990

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207549008942719

zbMATH Keywords

approximationsperformance characteristicsintermediate buffersbalanced flowlinesidentical workstations

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Production models (90B30) Inventory, storage, reservoirs (90B05)

Related Items (6)

A predictive model for the throughput of simple assembly systems ⋮ Manufacturing flow line systems: A review of models and analytical results ⋮ Buffer allocation in general single-server queueing networks ⋮ A simple heuristic for buffer design in finite-capacity queues ⋮ Queueing theory in manufacturing systems analysis and design: A classification of models for production and transfer lines ⋮ Capacity improvement of an unreliable production line -- an analytical approach

Cites Work

• An Efficient Decomposition Method for the Approximate Evaluation of Tandem Queues with Finite Storage Space and Blocking
• A queueing system with impatient customers

This page was built for publication: Computationally efficient approximations for balanced flowlines with finite intermediate buffers