TY - JOUR
T1 - Convexity properties of the overflow in an ordered-entry system with heterogeneous servers
AU - Yao, David D.
PY - 1986/8
Y1 - 1986/8
N2 - The overflow probability in an Erlang loss system is known to be decreasing convex in the number of servers. Here we consider the GI/M/m loss system with ordered entry and heterogeneous servers. We show that adding a sequence of servers with non-increasing (non-decreasing) service rates will yield a decreasing convex (log-concave) sequence of overflow probabilities. An optimal server allocation problem is solved as a direct application of these results. © 1986.
AB - The overflow probability in an Erlang loss system is known to be decreasing convex in the number of servers. Here we consider the GI/M/m loss system with ordered entry and heterogeneous servers. We show that adding a sequence of servers with non-increasing (non-decreasing) service rates will yield a decreasing convex (log-concave) sequence of overflow probabilities. An optimal server allocation problem is solved as a direct application of these results. © 1986.
KW - convexity
KW - overflow system
KW - server allocation
UR - http://www.scopus.com/inward/record.url?scp=0022763250&partnerID=8YFLogxK
UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-0022763250&origin=recordpage
U2 - 10.1016/0167-6377(86)90087-8
DO - 10.1016/0167-6377(86)90087-8
M3 - 21_Publication in refereed journal
VL - 5
SP - 145
EP - 147
JO - Operations Research Letters
JF - Operations Research Letters
SN - 0167-6377
IS - 3
ER -