By Topic

Customer scheduling under queueing constraints

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Rosberg, Z. ; IBM Israel, Technion City, Haifa, Israel ; Kermani, P.

A scheduling problem of an exponential single server with a finite queueing capacity that serves customers from n heterogeneous classes is considered. Arrivals are Poissonian and every class has its own rate and its own finite waiting room. The waiting rooms can be of arbitrary size. Arriving customers that find a full queue are lost. Of particular interest is finding a scheduling policy that allows service preemption and has a weighted throughput which is close enough to the optimal one. As an optimal scheduling policy is extremely hard to find, a different methodology is used to tackle the problem. First, the optimal weighted throughput is bound from above, and the asymptotically optimal policy is found. Then, based on the bounding technique and the asymptotically optimal policy, a new policy, the overflow scheduling policy, that provides a weighted throughput which is very close to the upper bound is proposed. The quality of the policy is demonstrated by various examples

Published in:

Automatic Control, IEEE Transactions on  (Volume:37 ,  Issue: 2 )