By Topic

Optimal priority assignment with hard constraint

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)
Nain, P. ; INRIA Centre de Sophia Antipolis, Valbonne, France ; Ross, K.W.

We consider a discrete-time queueing system consisting of K + 1 classes of customers competing for a single server at an infinite capacity queue. For each customer class the arrival sequence forms a renewal sequence but is otherwise arbitrary. The service requirements are geometric with class-dependent parameter. The optimization criterion is to minimize a linear combination of the average line lengths for classes 1 through K , while simultaneously subjecting the average line length of class-0 customers to a hard constraint. The optimal policy is shown to be a randomized modification of a static-priority policy. The optimization problem is thereby reduced to a problem of finding the optimal randomization factor. This is done in a particular case, when the arrival processes are independent and geometrically distributed.

Published in:

Automatic Control, IEEE Transactions on  (Volume:31 ,  Issue: 10 )