The Value of Temporary Control for the M/M/1 Queue
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866913174393978880 |
|---|---|
| author | Kanavetas, Odysseas Koopmans, Camiel M. P. Spieksma, Floske M. |
| author_facet | Kanavetas, Odysseas Koopmans, Camiel M. P. Spieksma, Floske M. |
| contents | In this article, a one-off option for temporary service rate control for the M/M/1 queue is considered.
After taking this option, during a single exponentially distributed period, two service rates are available for use. Once service rate control is lost, the system continues with a fixed service rate $μ$. The objective is to minimise the sum of holding costs and service costs.
We approximate the expected total saved cost by taking the one-off option, depending on the starting state or starting distribution.
Using the Value Iteration algorithm with $M$-uniform geometric recurrence, we present methods to approximate the expected total saved future cost, as well as the expected total saved discounted future cost. Furthermore, we obtain theoretical results on the structure of optimal policies and strong Blackwell optimality. The paper is concluded by numerically applying the methods to various instances of the model. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2605_31573 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | The Value of Temporary Control for the M/M/1 Queue Kanavetas, Odysseas Koopmans, Camiel M. P. Spieksma, Floske M. Optimization and Control 90-10 In this article, a one-off option for temporary service rate control for the M/M/1 queue is considered. After taking this option, during a single exponentially distributed period, two service rates are available for use. Once service rate control is lost, the system continues with a fixed service rate $μ$. The objective is to minimise the sum of holding costs and service costs. We approximate the expected total saved cost by taking the one-off option, depending on the starting state or starting distribution. Using the Value Iteration algorithm with $M$-uniform geometric recurrence, we present methods to approximate the expected total saved future cost, as well as the expected total saved discounted future cost. Furthermore, we obtain theoretical results on the structure of optimal policies and strong Blackwell optimality. The paper is concluded by numerically applying the methods to various instances of the model. |
| title | The Value of Temporary Control for the M/M/1 Queue |
| topic | Optimization and Control 90-10 |
| url | https://arxiv.org/abs/2605.31573 |