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

Keith Ross, Bingtong Chen

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    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 languageEnglish (US)
    Title of host publicationProceedings of the IEEE Conference on Decision and Control
    PublisherIEEE
    Pages1491-1495
    Number of pages5
    StatePublished - 1987

    Fingerprint

    Structural properties
    Agglomeration
    Scheduling
    Decomposition
    Costs

    ASJC Scopus subject areas

    • Chemical Health and Safety
    • Control and Systems Engineering
    • Safety, Risk, Reliability and Quality

    Cite this

    Ross, K., & Chen, B. (1987). OPTIMAL SCHEDULING FOR AN M/G/1 QUEUEING SYSTEM WITH MULTIPLE CONSTRAINTS. In Proceedings of the IEEE Conference on Decision and Control (pp. 1491-1495). IEEE.

    OPTIMAL SCHEDULING FOR AN M/G/1 QUEUEING SYSTEM WITH MULTIPLE CONSTRAINTS. / Ross, Keith; Chen, Bingtong.

    Proceedings of the IEEE Conference on Decision and Control. IEEE, 1987. p. 1491-1495.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Ross, K & Chen, B 1987, OPTIMAL SCHEDULING FOR AN M/G/1 QUEUEING SYSTEM WITH MULTIPLE CONSTRAINTS. in Proceedings of the IEEE Conference on Decision and Control. IEEE, pp. 1491-1495.
    Ross K, Chen B. OPTIMAL SCHEDULING FOR AN M/G/1 QUEUEING SYSTEM WITH MULTIPLE CONSTRAINTS. In Proceedings of the IEEE Conference on Decision and Control. IEEE. 1987. p. 1491-1495
    Ross, Keith ; Chen, Bingtong. / OPTIMAL SCHEDULING FOR AN M/G/1 QUEUEING SYSTEM WITH MULTIPLE CONSTRAINTS. Proceedings of the IEEE Conference on Decision and Control. IEEE, 1987. pp. 1491-1495
    @inproceedings{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 = "Keith Ross and Bingtong Chen",
    year = "1987",
    language = "English (US)",
    pages = "1491--1495",
    booktitle = "Proceedings of the IEEE Conference on Decision and Control",
    publisher = "IEEE",

    }

    TY - GEN

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

    AU - Ross, Keith

    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

    M3 - Conference contribution

    AN - SCOPUS:0023581515

    SP - 1491

    EP - 1495

    BT - Proceedings of the IEEE Conference on Decision and Control

    PB - IEEE

    ER -