Abstract
Various systems across a broad range of applications contain tandem queues. Strong dependence between the servers has proven to make such networks complicated and difficult to study. Exact analysis is rarely computationally tractable and sometimes not even possible. Nevertheless, as it is most often the case in reality, there are costs associated with running such systems, and therefore, optimizing the control of tandem queues is of main interest from both a theoretical and a practical point of view. Motivated by this, the present paper considers a tandem queueing network with linear holding costs and a startup cost for the second server. In our work, we present a rather intuitive, easy to understand, and at the same time very accurate technique to approximate the optimal decision policy. Extensive numerical experimentation shows that the approximation works extremely well for a wide range of parameter combinations.
Original language | English |
---|---|
Pages (from-to) | 362-374 |
Number of pages | 13 |
Journal | Stochastic Models |
Volume | 34 |
Issue number | 3 |
Early online date | 11 Sept 2018 |
DOIs | |
Publication status | Published - 2018 |
Bibliographical note
Published online: 11 Sep 2018Keywords
- Approximation algorithm
- MDP
- optimal control
- startup costs
- tandem queue