DocumentCode
1233424
Title
Optimal priority assignment: a time sharing approach
Author
Altman, Eitan ; Shwartz, Adam
Author_Institution
Dept. of Electr. Eng., Technion-Israel, Haifa, Israel
Volume
34
Issue
10
fYear
1989
fDate
10/1/1989 12:00:00 AM
Firstpage
1098
Lastpage
1102
Abstract
Nonstationary time-sharing policies are introduced to obtain optimal controls for new constrained optimization problems. The criteria are expected time averages of sizes of the queues. These policies and their cost are computed through linear programs. The achievable region of the vector of queues´ length is characterized. Other applications of time-sharing policies are discussed
Keywords
linear programming; optimal control; probability; queueing theory; constrained optimization; linear programming; nonstationary time-sharing policies; optimal controls; optimal priority assignment; queueing theory; Ambient intelligence; Computational efficiency; Convergence; Least squares approximation; Linear systems; Parameter estimation; Recursive estimation; Stability; Standards development; Time sharing computer systems;
fLanguage
English
Journal_Title
Automatic Control, IEEE Transactions on
Publisher
ieee
ISSN
0018-9286
Type
jour
DOI
10.1109/9.35286
Filename
35286
Link To Document