The Best Order for Queues in Series
From MaRDI portal
Publication:3750477
Recommendations
Cited in
(17)- The Brownian approximation for rate-control throttles and the \(G/G/1/C\) queue
- Order restoration in queues
- Approximate decomposition methods for the analysis of multicommodity flow routing in generalized queuing networks
- Design of manufacturing systems using queueing models
- Approximations for departure processes and queues in series
- Topological arrangements of \(M/G/c/K\), \(M/G/c/c\) queues in transportation and material handling systems
- Time-varying tandem queues with blocking: modeling, analysis, and operational insights via fluid models with reflection
- A heuristic for determining the optimal order in a tandem queue
- The heavy-traffic bottleneck phenomenon in open queueing networks
- Traffic allocation for manufacturing systems
- Ordering of tandem constant-service stations to minimize in-process stock cost
- Note on the best order for queues in series
- Branch and Bound Algorithm for Ordering of Tandem Constant-Service Stations
- Optimal Order for Servers in Series with No Queue Capacity
- A review of open queueing network models of manufacturing systems
- Reordering an existing queue
- 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)