Publication:
Admission control with batch arrivals

dc.contributor.coauthorBurnetas, A
dc.contributor.departmentDepartment of Industrial Engineering
dc.contributor.kuauthorÖrmeci, Lerzan
dc.contributor.schoolcollegeinstituteCollege of Engineering
dc.date.accessioned2024-11-10T00:07:29Z
dc.date.issued2004
dc.description.abstractWe consider the problem of dynamic admission control in a multi-class Markovian loss system receiving random batches, where each admitted class-i job demands an exponential service with rate mu, and brings a reward r(i). We show that the optimal admission policy is a sequential threshold policy with monotone thresholds.
dc.description.indexedbyWOS
dc.description.indexedbyScopus
dc.description.issue5
dc.description.openaccessNO
dc.description.publisherscopeInternational
dc.description.sponsoredbyTubitakEuN/A
dc.description.volume32
dc.identifier.doi10.1016/j.orl.2004.01.001
dc.identifier.eissn1872-7468
dc.identifier.issn0167-6377
dc.identifier.scopus2-s2.0-2342452523
dc.identifier.urihttps://doi.org/10.1016/j.orl.2004.01.001
dc.identifier.urihttps://hdl.handle.net/20.500.14288/16775
dc.identifier.wos221561400007
dc.keywordsDynamic admission control
dc.keywordsThreshold policies
dc.keywordsLoss systems parallel servers
dc.keywordsQueuing-systems
dc.keywordsManagement
dc.language.isoeng
dc.publisherElsevier Science Bv
dc.relation.ispartofOperations Research Letters
dc.subjectOperations research
dc.subjectManagement science
dc.titleAdmission control with batch arrivals
dc.typeJournal Article
dspace.entity.typePublication
local.contributor.kuauthorÖrmeci, Lerzan
local.publication.orgunit1College of Engineering
local.publication.orgunit2Department of Industrial Engineering
relation.isOrgUnitOfPublicationd6d00f52-d22d-4653-99e7-863efcd47b4a
relation.isOrgUnitOfPublication.latestForDiscoveryd6d00f52-d22d-4653-99e7-863efcd47b4a
relation.isParentOrgUnitOfPublication8e756b23-2d4a-4ce8-b1b3-62c794a8c164
relation.isParentOrgUnitOfPublication.latestForDiscovery8e756b23-2d4a-4ce8-b1b3-62c794a8c164

Files