| Article ID: | iaor20127615 |
| Volume: | 33 |
| Issue: | 1 |
| Start Page Number: | 69 |
| End Page Number: | 86 |
| Publication Date: | Jan 1999 |
| Journal: | RAIRO - Operations Research |
| Authors: | Haqiq A, Mikou N |
| Keywords: | programming: dynamic, combinatorial optimization |
We consider two parallel M/M/1 queues. The server at one of the queues is subject to intermittent breakdowns. By the theory of dynamic programming, we determine a threshold optimal policy which consists to transfer, when it is necessary, the customers that arrive at the first queue towards the second queue in order to minimize an instantaneous cost depending of the two queue lengths.