Thumbnail
Access Restriction
Open

Author Liu, Zaiming ♦ Deng, Wei ♦ Chen, Gang
Editor Zhang, Qingling
Source Hindawi
Content type Text
Publisher Hindawi
File Format PDF
Copyright Year ©2017
Language English
Abstract We study a controllable two-station tandem queueing system, where customers (jobs) must first be processed at upstream station and then the downstream station. A manager dynamically allocates the service resource to each station to adjust the service rate, leading to a tradeoff between the holding cost and resource cost. The goal of the manager is to find the optimal policy to minimize the long-run average costs. The problem is constructed as a Markov decision process (MDP). In this paper, we consider the model in which the resource cost and service rate functions are more general than linear. We derive the monotonicity of the optimal allocation policy by the quasiconvexity properties of the value function. Furthermore, we obtain the relationship between the two stations’ optimal policy and conditions under which the optimal policy is unique and has the bang-bang control property. Finally, we provide some numerical experiments to illustrate these results.
ISSN 1024123X
Learning Resource Type Article
Publisher Date 2017-11-28
Rights License This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
e-ISSN 15635147
Journal Mathematical Problems in Engineering
Volume Number 2017
Page Count 10


Open content in new tab

   Open content in new tab