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

DOI10.1017/S0269964800004952MaRDI QIDQ5488551zbMATH OpenFDO

Authors Janice Kim Winch

Publication date 22 September 2006

Published in Probability in the Engineering and Informational Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/S0269964800004952

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• Ordering of tandem constant-service stations to minimize in-process stock cost
• scientific article; zbMATH DE number 4076936
• On Optimal Arrangement of Stations in a Tandem Queueing System with Blocking
• Optimal order for two servers in tandem
• On the optimal order of M machines in tandem

Cites work

• A Sequence of Service Stations with Arbitrary Input and Regular Service Times
• On Optimal Arrangement of Stations in a Tandem Queueing System with Blocking
• On the optimal order of M machines in tandem
• Optimal Order of Servers for Tandem Queues in Light Traffic
• Reduction Methods for Tandem Queuing Systems
• The Best Order for Queues in Series
• The Cafeteria Process—Tandem Queues with 0-1 Dependent Service Times and the Bowl Shape Phenomenon
• The interchangeability of ·/M/1 queues in series
• The interchangeability of tandem queues with heterogeneous customers and dependent service times
• The Optimal Order of Service in Tandem Queues

Cited in

(2)

• Ordering of tandem constant-service stations to minimize in-process stock cost
• On the optimal order of M machines in tandem

This page was built for publication: Branch and Bound Algorithm for Ordering of Tandem Constant-Service Stations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5488551)