Optimal service rates for the state-dependent \(M/G/1\) queues in steady state

DOI10.1016/S0167-6377(01)00084-0zbMath0981.90008OpenAlexW2094889932WikidataQ126666569 ScholiaQ126666569MaRDI QIDQ5949920

Xin Chen, Winfried K. Grassmann, Brij R. K. Kashyap

Publication date: 5 December 2001

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-6377(01)00084-0

zbMATH Keywords

Markov chainsqueueequilibrium probabilitiesoptimal service rate

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Markov and semi-Markov decision processes (90C40)

Related Items (3)

Optimal design and control of queues ⋮ Balancing herding and congestion in service systems: a queueing perspective ⋮ A BAYESIAN APPROACH TO FIND RANDOM-TIME PROBABILITIES FROM EMBEDDED MARKOV CHAIN PROBABILITIES

Cites Work

• Unnamed Item
• Unnamed Item
• Optimizing steady state Markov chains by state reduction
• Opsearch
• Some Theorems on a Single-Server Queue with Balking
• The GI/PH/1 Queue: a Method to Find The Transition Matrix
• The Steady State Behaviour Of TheM/Ek/1Queue, With State Dependent Arrival Rates
• The Use of Derivatives for Optimizing Steady State Queues

This page was built for publication: Optimal service rates for the state-dependent \(M/G/1\) queues in steady state