TY - GEN
T1 - A greedy randomized algorithm achieving sublinear optimality gap in a dynamic packing model
AU - Stolyar, Alexander L.
AU - Zhong, Yuan
N1 - Publisher Copyright:
© 2016 IEEE.
PY - 2017/2/10
Y1 - 2017/2/10
N2 - We consider an infinite-server system, where multiple customers can be placed into one server for service simultaneously, subject to packing constraints. Customers are placed for service immediately upon arrival, and leave the system after service completion.
AB - We consider an infinite-server system, where multiple customers can be placed into one server for service simultaneously, subject to packing constraints. Customers are placed for service immediately upon arrival, and leave the system after service completion.
UR - http://www.scopus.com/inward/record.url?scp=85015189942&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85015189942&partnerID=8YFLogxK
U2 - 10.1109/ALLERTON.2016.7852247
DO - 10.1109/ALLERTON.2016.7852247
M3 - Conference contribution
AN - SCOPUS:85015189942
T3 - 54th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2016
SP - 319
EP - 326
BT - 54th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2016
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 54th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2016
Y2 - 27 September 2016 through 30 September 2016
ER -