A Sequence of Service Stations with Arbitrary Input and Regular Service Times
From MaRDI portal
Publication:5536014
DOI10.1287/mnsc.11.5.565zbMath0156.18602OpenAlexW2158134789MaRDI QIDQ5536014
Publication date: 1965
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.11.5.565
Related Items (18)
On the optimal assignment of servers in a two stations tandem queue with no intermediate waiting room ⋮ The throughput rate of serial production lines with deterministic process times and random setups: Markovian models and applications to semiconductor manufacturing ⋮ On the order of tandem queues ⋮ Approximate analysis of exponential tandem queues with blocking ⋮ Reduction of a polling network to a single node ⋮ Time-varying tandem queues with blocking: modeling, analysis, and operational insights via fluid models with reflection ⋮ Manufacturing flow line systems: A review of models and analytical results ⋮ Response time in a tandem queue with blocking, Markovian arrivals and phase-type services ⋮ Queueing theory ⋮ Path delays in communication networks ⋮ Sample-path large deviations for tandem and priority queues with Gaussian inputs ⋮ A study of queueing networks with deterministic service and application to computer networks ⋮ Ordering of Tandem Constant-Service Stations to Minimize In-Process Stock Cost ⋮ Asymptotic analysis of Lévy-driven tandem queues ⋮ Time-varying many-server finite-queues in tandem: comparing blocking mechanisms via fluid models ⋮ Queueing theory in manufacturing systems analysis and design: A classification of models for production and transfer lines ⋮ Analysis of an open tandem queueing network with population constraint and constant service times ⋮ Branch and Bound Algorithm for Ordering of Tandem Constant-Service Stations
This page was built for publication: A Sequence of Service Stations with Arbitrary Input and Regular Service Times
