A greedy randomized algorithm achieving sublinear optimality gap in a dynamic packing model

Aleksandr Stolyar, Yuan Zhong

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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.

Original languageEnglish (US)
Title of host publication54th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2016
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages319-326
Number of pages8
ISBN (Electronic)9781509045495
DOIs
StatePublished - Feb 10 2017
Externally publishedYes
Event54th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2016 - Monticello, United States
Duration: Sep 27 2016Sep 30 2016

Publication series

Name54th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2016

Other

Other54th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2016
CountryUnited States
CityMonticello
Period9/27/169/30/16

ASJC Scopus subject areas

  • Artificial Intelligence
  • Computational Theory and Mathematics
  • Computer Networks and Communications
  • Hardware and Architecture
  • Control and Optimization

Fingerprint Dive into the research topics of 'A greedy randomized algorithm achieving sublinear optimality gap in a dynamic packing model'. Together they form a unique fingerprint.

Cite this