Branch and Bound Algorithm for Ordering of Tandem Constant-Service Stations
From MaRDI portal
Publication:5488551
DOI10.1017/S0269964800004952zbMath1096.90549MaRDI QIDQ5488551
Publication date: 22 September 2006
Published in: Probability in the Engineering and Informational Sciences (Search for Journal in Brave)
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Cites Work
- On the optimal order of M machines in tandem
- The interchangeability of ·/M/1 queues in series
- The Best Order for Queues in Series
- Optimal Order of Servers for Tandem Queues in Light Traffic
- On Optimal Arrangement of Stations in a Tandem Queueing System with Blocking
- The interchangeability of tandem queues with heterogeneous customers and dependent service times
- The Optimal Order of Service in Tandem Queues
- The Cafeteria Process—Tandem Queues with 0-1 Dependent Service Times and the Bowl Shape Phenomenon
- Reduction Methods for Tandem Queuing Systems
- A Sequence of Service Stations with Arbitrary Input and Regular Service Times
This page was built for publication: Branch and Bound Algorithm for Ordering of Tandem Constant-Service Stations