Thumbnail
Access Restriction
Subscribed

Author Babad, Jair M. ♦ Modiano, Mario M.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Priority queues ♦ Semi-markov process ♦ Price scheduling ♦ Operating system
Abstract Consider a multipriority batch computer system which users from several different classes may join, with toll, service, and waiting charges. Such a system is formulated here as a semi-Markov decision process, in which the aim of arriving users is to minimize their expected loss. The optimal joining policy of arriving users who may join the system at some of its queues is a control limit policy, with a single control number for any possible queue and the user's class; a newly arriving user will join a queue that is not filled up to the control number corresponding to this queue and the user's class. In this paper control numbers, as well as lower and upper bounds for the control numbers and the capacities of the system's queues, are derived.
Description Affiliation: Harvard Univ., Boston, MA (Modiano, Mario M.) || Univ. of Chicago, Chicago, IL (Babad, Jair M.)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 19
Issue Number 3
Page Count 10
Starting Page 127
Ending Page 136


Open content in new tab

   Open content in new tab
Source: ACM Digital Library