Vestnik YuUrGU. Ser. Mat. Model. Progr., 2019, Volume 12, Issue 1, Pages 44–54
Performance bounds and suboptimal policies for multi-class queue
University of Zabol, Zabol, Iran
In this paper, we consider a general class of a queuing system with multiple job types and flexible service facility. We use a stochastic control policy to determine the performance loss in multi-class M/M/1 queue. The considered system is originally a Markov decision processes (MDP). The author showed how to compute performance bounds for the stochastic control policy of MDP with an average cost criteria. In practice, many authors used heuristic control policies due to some hardness in computing and running mathematically optimal policies. The authors found bounds on performance in order to an optimal policy where the goal of this job is to compute the difference of optimality and a specific policy. In other words, this study shows that, the optimal bounds of the average queue length for any non-idling policies can be found by a factor of service rates.
queueing system, multiple job classes, stochastic control policy.
PDF file (194 kB)
MSC: 93E20, 60J50, 60G40
A. Madankan, “Performance bounds and suboptimal policies for multi-class queue”, Vestnik YuUrGU. Ser. Mat. Model. Progr., 12:1 (2019), 44–54
Citation in format AMSBIB
\paper Performance bounds and suboptimal policies for multi-class queue
\jour Vestnik YuUrGU. Ser. Mat. Model. Progr.
Citing articles on Google Scholar:
Related articles on Google Scholar:
|Number of views:|