By Topic

Optimal control and scheduling in a multiclass queueing network: results and conjectures

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
$33 $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

3 Author(s)
P. Yang ; Texas Univ., Dallas, TX, USA ; H. Chen ; D. D. Yao

Dynamic scheduling and control in queuing networks are addressed. A two-station queuing network with two types of jobs is studied. Type 1 jobs visit stations, 1 and 2 in sequence, and type 2 jobs visit station 1 only. The problem is to control the (external) arrival processes and the service processes, as well as to schedule the server at station 1 among the two types of jobs. The objective is to minimize a discounted cost function over an infinite time horizon. The approach is based on stochastic intensity representation of point processes. The problem is divided into several cases, each corresponding to a certain parameter range. Optimal control and scheduling are derived for some cases. For the other cases, conjectures for the optimality of certain simple threshold policies are presented

Published in:

Decision and Control, 1990., Proceedings of the 29th IEEE Conference on

Date of Conference:

5-7 Dec 1990