The Best Order for Queues in Series
From MaRDI portal
Publication:3750477
DOI10.1287/MNSC.31.4.475zbMATH Open0609.90045OpenAlexW2078873034MaRDI QIDQ3750477FDOQ3750477
Authors: Ward Whitt 
Publication date: 1985
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.31.4.475
Recommendations
approximation methodsheuristic designbest orderexpected equilibrium sojourn time per customerservice stations in series
Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25)
Cited In (17)
- The Brownian approximation for rate-control throttles and the \(G/G/1/C\) queue
- Time-varying tandem queues with blocking: modeling, analysis, and operational insights via fluid models with reflection
- Design of manufacturing systems using queueing models
- Optimal Order for Servers in Series with No Queue Capacity
- Note on the best order for queues in series
- Ordering of tandem constant-service stations to minimize in-process stock cost
- Traffic allocation for manufacturing systems
- Approximations for departure processes and queues in series
- Branch and Bound Algorithm for Ordering of Tandem Constant-Service Stations
- A review of open queueing network models of manufacturing systems
- A heuristic for determining the optimal order in a tandem queue
- Topological arrangements of \(M/G/c/K\), \(M/G/c/c\) queues in transportation and material handling systems
- Order restoration in queues
- Reordering an existing queue
- Approximate decomposition methods for the analysis of multicommodity flow routing in generalized queuing networks
- The heavy-traffic bottleneck phenomenon in open queueing networks
- Several Results on the Design of Queueing Systems
This page was built for publication: The Best Order for Queues in Series
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3750477)
