COMPUTATION OF STEADY-STATE PROBABILITIES FOR RESOURCE-SHARING CALL-CENTER QUEUEING SYSTEMS

DOI10.1081/STM-100002063zbMath0994.90014MaRDI QIDQ2746234

Carl M. Harris, Martin J. Fischer, Denise M. Bevilacqua Masi

Publication date: 10 October 2001

Published in: Stochastic Models (Search for Journal in Brave)

zbMATH Keywords

networkprobability distributionqueueing system

Mathematics Subject Classification ID

Stochastic network models in operations research (90B15) Stochastic models in economics (91B70) Queues and service in operations research (90B22)

Related Items (2)

Maximum queue lengths during a fixed time interval in the \(M/M/c\) retrial queue ⋮ Applications of maximum queue lengths to call center management

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A survey on retrial queues
• Some analytical results for congestion in subscriber line modules
• Why queuing never vanishes
• Optimizing Bernoulli routing policies for balancing loads on call centers and minimizing transmission costs
• Matrix-geometric analysis of the shortest queue problem with threshold jockeying
• Two Similar Queues in Parallel
• J.comput. appl. math
• The shortest queue problem
• Computation of Steady-State Probabilities for M/M/1 Priority Queues
• Two coupled processors: The reduction to a Riemann-Hilbert problem

This page was built for publication: COMPUTATION OF STEADY-STATE PROBABILITIES FOR RESOURCE-SHARING CALL-CENTER QUEUEING SYSTEMS