IDEAS home Printed from https://ideas.repec.org/a/eee/spapps/v25y1987ip301-308.html
   My bibliography  Save this article

Certain optimality properties of the first-come first-served discipline for G/G/s queues

Author

Listed:
  • Daley, D. J.

Abstract

It is shown that for many server queueing systems in which arrivals are allocated to servers in a manner that does not depend on their service times, the vector of work-loads or virtual waiting times is least in the sense of weak majorization when the discipline is first-come first-served. Thus, the maximum work-load and the total work-load are minimized under this "intuitively obvious" minimizing discipline.

Suggested Citation

  • Daley, D. J., 1987. "Certain optimality properties of the first-come first-served discipline for G/G/s queues," Stochastic Processes and their Applications, Elsevier, vol. 25, pages 301-308.
    • Handle: RePEc:eee:spapps:v:25:y:1987:i::p:301-308
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0304-4149(87)90208-0
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Rami Atar & Isaac Keslassy & Gal Mendelson, 2019. "Replicate to the shortest queues," Queueing Systems: Theory and Applications, Springer, vol. 92(1), pages 1-23, June.
    2. L. D. Servi & S. Humair, 1999. "Optimizing Bernoulli Routing Policies for Balancing Loads on Call Centers and Minimizing Transmission Costs," Journal of Optimization Theory and Applications, Springer, vol. 100(3), pages 623-659, March.
    3. Habib, Ahsan, 2008. "The role of accruals and cash flows in explaining security returns: Evidence from New Zealand," Journal of International Accounting, Auditing and Taxation, Elsevier, vol. 17(1), pages 51-66.
    4. Esa Hyytiä & Peter Jacko & Rhonda Righter, 2022. "Routing with too much information?," Queueing Systems: Theory and Applications, Springer, vol. 100(3), pages 441-443, April.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:spapps:v:25:y:1987:i::p:301-308. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/505572/description#description .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.