Ordering of tandem constant-service stations to minimize in-process stock cost
From MaRDI portal
Publication:2805369
DOI10.1017/S0269964800003971zbMATH Open1335.90024MaRDI QIDQ2805369FDOQ2805369
Authors: Janice Kim Winch, Benjamin Avi-Itzhak 
Publication date: 11 May 2016
Published in: Probability in the Engineering and Informational Sciences (Search for Journal in Brave)
Recommendations
- Branch and Bound Algorithm for Ordering of Tandem Constant-Service Stations
- scientific article; zbMATH DE number 4076936
- On Optimal Arrangement of Stations in a Tandem Queueing System with Blocking
- Optimal order of servers in a tandem queue with general blocking
- Optimal Order of Servers for Tandem Queues in Light Traffic
Cites Work
- Reduction Methods for Tandem Queuing Systems
- A Sequence of Service Stations with Arbitrary Input and Regular Service Times
- The interchangeability of ·/M/1 queues in series
- The Optimal Order of Service in Tandem Queues
- Optimal Order of Servers for Tandem Queues in Light Traffic
- The Reversibility Property of Production Lines
- Properties of duality in tandem queueing systems
- On the optimal order of M machines in tandem
- Note—A Note on the Reversibility and Duality of Some Tandem Blocking Queueing Systems
- The Best Order for Queues in Series
- Probabilistic proof of the interchangeability of ./M/1 queues in series
- On the ordering of tandem queues with exponential servers
- On Optimal Arrangement of Stations in a Tandem Queueing System with Blocking
- The interchangeability of tandem queues with heterogeneous customers and dependent service times
- On the interchangeability and stochastic ordering of ·/M/1 queues in tandem
Cited In (1)
This page was built for publication: Ordering of tandem constant-service stations to minimize in-process stock cost
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2805369)
