Ordering of tandem constant-service stations to minimize in-process stock cost

DOI10.1017/S0269964800003971MaRDI QIDQ2805369zbMATH OpenFDO

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)

Mathematics Subject Classification ID

Queues and service in operations research (90B22)

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

• A Sequence of Service Stations with Arbitrary Input and Regular Service Times
• Note—A Note on the Reversibility and Duality of Some Tandem Blocking Queueing Systems
• On Optimal Arrangement of Stations in a Tandem Queueing System with Blocking
• On the interchangeability and stochastic ordering of ·/M/1 queues in tandem
• On the optimal order of M machines in tandem
• On the ordering of tandem queues with exponential servers
• Optimal Order of Servers for Tandem Queues in Light Traffic
• Probabilistic proof of the interchangeability of ./M/1 queues in series
• Properties of duality in tandem queueing systems
• Reduction Methods for Tandem Queuing Systems
• The Best Order for Queues in Series
• The Optimal Order of Service in Tandem Queues
• The Reversibility Property of Production Lines
• The interchangeability of tandem queues with heterogeneous customers and dependent service times
• The interchangeability of ·/M/1 queues in series

Cited in

(1)

• Branch and Bound Algorithm for Ordering of Tandem Constant-Service Stations

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)