Computational algorithm and parameter optimization for a multi-server system with unreliable servers and impatient customers
We consider an infinite capacity M/M/c queueing system with c unreliable servers, in which the customers may balk (do not enter) and renege (leave the queue after entering). The system is analyzed as a quasi-birth-and-death (QBD) process and the necessary and sufficient condition of system equilibri...
Saved in:
Published in | Journal of computational and applied mathematics Vol. 235; no. 3; pp. 547 - 562 |
---|---|
Main Authors | , |
Format | Journal Article |
Language | English |
Published |
Kidlington
Elsevier B.V
01.12.2010
Elsevier |
Subjects | |
Online Access | Get full text |
ISSN | 0377-0427 1879-1778 |
DOI | 10.1016/j.cam.2010.06.005 |
Cover
Loading…