OPTIMAL SCHEDULING FOR AN M/G/1 QUEUEING SYSTEM WITH MULTIPLE CONSTRAINTS.

Keith W. Ross; Bingtong Chen

doi:10.1109/cdc.1987.272664

OPTIMAL SCHEDULING FOR AN M/G/1 QUEUEING SYSTEM WITH MULTIPLE CONSTRAINTS.

Keith W. Ross, Bingtong Chen

Research output: Contribution to journal › Conference article › peer-review

Abstract

The problem of finding an optimal scheduling policy that minimizes a linear combination of the average delays for the noniteractive types while meeting the design constraints is considered. Simple necessary and sufficient conditions are derived for the existence of a policy that satisfies the constraints. An algorithm is given that decomposes the traffic types into an ordered arrangement of groups, and the existence of a policy that gives strict priority accordingly is established. Under weak conditions on the costs and rates, it is shown that all optimal policies must have this structural property. Sensitivity and aggregation analyses are given. Using the above decomposition, an optimal policy is constructed and is shown to have many appealing properties.

Original language	English (US)
Pages (from-to)	1491-1495
Number of pages	5
Journal	Proceedings of the IEEE Conference on Decision and Control
DOIs	https://doi.org/10.1109/cdc.1987.272664
State	Published - 1987

ASJC Scopus subject areas

Control and Systems Engineering
Modeling and Simulation
Control and Optimization

Access to Document

10.1109/cdc.1987.272664

Cite this

@article{a4cbc7dac1464727a6f2d565e317c9d9,

title = "OPTIMAL SCHEDULING FOR AN M/G/1 QUEUEING SYSTEM WITH MULTIPLE CONSTRAINTS.",

abstract = "The problem of finding an optimal scheduling policy that minimizes a linear combination of the average delays for the noniteractive types while meeting the design constraints is considered. Simple necessary and sufficient conditions are derived for the existence of a policy that satisfies the constraints. An algorithm is given that decomposes the traffic types into an ordered arrangement of groups, and the existence of a policy that gives strict priority accordingly is established. Under weak conditions on the costs and rates, it is shown that all optimal policies must have this structural property. Sensitivity and aggregation analyses are given. Using the above decomposition, an optimal policy is constructed and is shown to have many appealing properties.",

author = "Ross, {Keith W.} and Bingtong Chen",

year = "1987",

doi = "10.1109/cdc.1987.272664",

language = "English (US)",

pages = "1491--1495",

journal = "Proceedings of the IEEE Conference on Decision and Control",

issn = "0191-2216",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - JOUR

T1 - OPTIMAL SCHEDULING FOR AN M/G/1 QUEUEING SYSTEM WITH MULTIPLE CONSTRAINTS.

AU - Ross, Keith W.

AU - Chen, Bingtong

PY - 1987

Y1 - 1987

N2 - The problem of finding an optimal scheduling policy that minimizes a linear combination of the average delays for the noniteractive types while meeting the design constraints is considered. Simple necessary and sufficient conditions are derived for the existence of a policy that satisfies the constraints. An algorithm is given that decomposes the traffic types into an ordered arrangement of groups, and the existence of a policy that gives strict priority accordingly is established. Under weak conditions on the costs and rates, it is shown that all optimal policies must have this structural property. Sensitivity and aggregation analyses are given. Using the above decomposition, an optimal policy is constructed and is shown to have many appealing properties.

AB - The problem of finding an optimal scheduling policy that minimizes a linear combination of the average delays for the noniteractive types while meeting the design constraints is considered. Simple necessary and sufficient conditions are derived for the existence of a policy that satisfies the constraints. An algorithm is given that decomposes the traffic types into an ordered arrangement of groups, and the existence of a policy that gives strict priority accordingly is established. Under weak conditions on the costs and rates, it is shown that all optimal policies must have this structural property. Sensitivity and aggregation analyses are given. Using the above decomposition, an optimal policy is constructed and is shown to have many appealing properties.

UR - http://www.scopus.com/inward/record.url?scp=0023581515&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0023581515&partnerID=8YFLogxK

U2 - 10.1109/cdc.1987.272664

DO - 10.1109/cdc.1987.272664

M3 - Conference article

AN - SCOPUS:0023581515

SN - 0191-2216

SP - 1491

EP - 1495

JO - Proceedings of the IEEE Conference on Decision and Control

JF - Proceedings of the IEEE Conference on Decision and Control

ER -

OPTIMAL SCHEDULING FOR AN M/G/1 QUEUEING SYSTEM WITH MULTIPLE CONSTRAINTS.

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this