ON THE OPTIMAL CONTROL OF TWO QUEUES WITH SERVER SETUP TIMES AND ITS ANALYSIS.

Micha Hofri, Keith Ross

    Research output: Contribution to journalArticle

    Abstract

    Two queues are fed by independent, time-homogeneous Poisson arrival processes. One server is available to handle both. All service durations, in both queues, are drawn independently from the same distribution. A setup time is incurred whenever the server moves (switches) from one queue to the other. We prove that in order to minimize the sum of discounted setup charges and holdings costs, assumed linear in queue length and having the same rate at the two queues, the service at each queue should be exhaustive. A 'threshold policy' is defined as a policy under which the server switches (from an empty queue) only when the other reaches a critical size. It is shown to be a likely candidate for the optimal policy, both for the discounted version and for the long-time average criterion. The steady-state performance of this policy (under somewhat more general distributional assumptions) and the optimal thresholds are determined for a number of cases.

    Original languageEnglish (US)
    Pages (from-to)399-420
    Number of pages22
    JournalSIAM Journal on Computing
    Volume16
    Issue number2
    StatePublished - Apr 1987

    Fingerprint

    Setup Times
    Queue
    Optimal Control
    Servers
    Server
    Switches
    Switch
    Queue Length
    Time-average
    Optimal Policy
    Costs
    Siméon Denis Poisson
    Likely
    Charge
    Minimise
    Policy

    ASJC Scopus subject areas

    • Computational Theory and Mathematics
    • Applied Mathematics
    • Theoretical Computer Science

    Cite this

    ON THE OPTIMAL CONTROL OF TWO QUEUES WITH SERVER SETUP TIMES AND ITS ANALYSIS. / Hofri, Micha; Ross, Keith.

    In: SIAM Journal on Computing, Vol. 16, No. 2, 04.1987, p. 399-420.

    Research output: Contribution to journalArticle

    Hofri, Micha ; Ross, Keith. / ON THE OPTIMAL CONTROL OF TWO QUEUES WITH SERVER SETUP TIMES AND ITS ANALYSIS. In: SIAM Journal on Computing. 1987 ; Vol. 16, No. 2. pp. 399-420.
    @article{97248a82776c439590c38c87ad2680e0,
    title = "ON THE OPTIMAL CONTROL OF TWO QUEUES WITH SERVER SETUP TIMES AND ITS ANALYSIS.",
    abstract = "Two queues are fed by independent, time-homogeneous Poisson arrival processes. One server is available to handle both. All service durations, in both queues, are drawn independently from the same distribution. A setup time is incurred whenever the server moves (switches) from one queue to the other. We prove that in order to minimize the sum of discounted setup charges and holdings costs, assumed linear in queue length and having the same rate at the two queues, the service at each queue should be exhaustive. A 'threshold policy' is defined as a policy under which the server switches (from an empty queue) only when the other reaches a critical size. It is shown to be a likely candidate for the optimal policy, both for the discounted version and for the long-time average criterion. The steady-state performance of this policy (under somewhat more general distributional assumptions) and the optimal thresholds are determined for a number of cases.",
    author = "Micha Hofri and Keith Ross",
    year = "1987",
    month = "4",
    language = "English (US)",
    volume = "16",
    pages = "399--420",
    journal = "SIAM Journal on Computing",
    issn = "0097-5397",
    publisher = "Society for Industrial and Applied Mathematics Publications",
    number = "2",

    }

    TY - JOUR

    T1 - ON THE OPTIMAL CONTROL OF TWO QUEUES WITH SERVER SETUP TIMES AND ITS ANALYSIS.

    AU - Hofri, Micha

    AU - Ross, Keith

    PY - 1987/4

    Y1 - 1987/4

    N2 - Two queues are fed by independent, time-homogeneous Poisson arrival processes. One server is available to handle both. All service durations, in both queues, are drawn independently from the same distribution. A setup time is incurred whenever the server moves (switches) from one queue to the other. We prove that in order to minimize the sum of discounted setup charges and holdings costs, assumed linear in queue length and having the same rate at the two queues, the service at each queue should be exhaustive. A 'threshold policy' is defined as a policy under which the server switches (from an empty queue) only when the other reaches a critical size. It is shown to be a likely candidate for the optimal policy, both for the discounted version and for the long-time average criterion. The steady-state performance of this policy (under somewhat more general distributional assumptions) and the optimal thresholds are determined for a number of cases.

    AB - Two queues are fed by independent, time-homogeneous Poisson arrival processes. One server is available to handle both. All service durations, in both queues, are drawn independently from the same distribution. A setup time is incurred whenever the server moves (switches) from one queue to the other. We prove that in order to minimize the sum of discounted setup charges and holdings costs, assumed linear in queue length and having the same rate at the two queues, the service at each queue should be exhaustive. A 'threshold policy' is defined as a policy under which the server switches (from an empty queue) only when the other reaches a critical size. It is shown to be a likely candidate for the optimal policy, both for the discounted version and for the long-time average criterion. The steady-state performance of this policy (under somewhat more general distributional assumptions) and the optimal thresholds are determined for a number of cases.

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

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

    M3 - Article

    AN - SCOPUS:0023329388

    VL - 16

    SP - 399

    EP - 420

    JO - SIAM Journal on Computing

    JF - SIAM Journal on Computing

    SN - 0097-5397

    IS - 2

    ER -