| Article ID: | iaor20051167 |
| Country: | Germany |
| Volume: | 58 |
| Issue: | 3 |
| Start Page Number: | 477 |
| End Page Number: | 482 |
| Publication Date: | Jan 2003 |
| Journal: | Mathematical Methods of Operations Research (Heidelberg) |
| Authors: | Kim J., Bae J., Lee E.Y. |
We consider a two-stage service policy for a Poisson arrival queueing system. The idle server starts to work with ordinary service rate when a customer arrives. If the number of customers in the system reaches N, the service rate gets faster and continues until the system becomes empty. Otherwise, the server finishes the busy period with ordinary service rate. After assigning various operating costs to the system, we show that there exists a unique fast service minimizing the long-run average cost per unit time.