Abstract
We consider theM/M/c queue, where customers transfer to a critical state when their queueing (sojourn) time exceeds a random time. Lower and upper bounds for the distribution of the number of critical jobs are derived from two modifications of the original system. The two modified systems can be efficiently solved. Numerical calculations indicate the power of the approach.
| Original language | English |
|---|---|
| Pages (from-to) | 341-353 |
| Number of pages | 13 |
| Journal | Mathematical Methods of Operations Research |
| Volume | 47 |
| Issue number | 3 |
| DOIs | |
| Publication status | Published - 1998 |