Cart (Loading....) | Create Account
Close category search window

Optimal control of a queueing system with two interacting service stations and three classes of impatient tasks

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

4 Author(s)
Wu, Z.-J. ; Dept. of Electron. Eng., Changsha Inst. of Technol., China ; Luh, P.B. ; Chang, S.-C. ; Castanon, D.A.

The problem of task selection and service priority is studied for a queueing network with two interacting service stations and three classes of impatient tasks. By using stochastic dynamic programming, a functional equation for the optimal, state-dependent priority assignment policy is derived. Properties of the optimal cost-to-go functions and the optimal policy are established through inductive proofs. It is shown that the optimal policy is governed by two switching surfaces in the three-dimensional state space (one dimension for each task class). For the infinite-time-horizon case, the optimal policy is shown to be stationary. In this case, the optimal cost-to-go function and switching surfaces are obtained numerically by using the overrelaxed Gauss-Seidel method. Sensitivities of the optimal policy with respect to key system parameters are also investigated.<>

Published in:

Automatic Control, IEEE Transactions on  (Volume:33 ,  Issue: 1 )

Date of Publication:

Jan. 1988

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.