Abstract
This paper considers a multi-server batch arrival MX/M/c queue with impatient customers. We give an exact expression for the loss probability, which can be expressed in terms of the waiting time distribution in the standard MX/M/c queue with no impatience. This solves the problem conjectured by Boots and Tijms (1999).
Original language | English |
---|---|
Pages (from-to) | 180-185 |
Number of pages | 6 |
Journal | Operations Research Letters |
Volume | 42 |
Issue number | 2 |
DOIs | |
Publication status | Published - 2014 Mar |
Keywords
- / M / c queue
- Impatient customers
- Loss probability
ASJC Scopus subject areas
- Software
- Management Science and Operations Research
- Industrial and Manufacturing Engineering
- Applied Mathematics