IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v25y1977i2p356-360.html
   My bibliography  Save this article

Technical Note—Optimal Service Policies, Just after Idle Periods, in Two-Server Heterogeneous Queuing Systems

Author

Listed:
  • Kiran Seth

    (Bell Laboratories, Piscataway, New Jersey)

Abstract

We consider a two-server queuing system in which the service time distributions of the two servers are different. Customer arrivals are Poisson distributed. Customers renege if their wait in queue exceeds T (a random time). Customers arriving when the system is empty can be served by either of the two servers. Under policy i , they are served by server i , i = 1, 2. Our objective is to find the policy that maximizes the number of customers served. Let server 1's service time be stochastically less than server 2's service time. Intuitively, the optimal policy is policy 1; a counter-example shows that this is not always true.

Suggested Citation

  • Kiran Seth, 1977. "Technical Note—Optimal Service Policies, Just after Idle Periods, in Two-Server Heterogeneous Queuing Systems," Operations Research, INFORMS, vol. 25(2), pages 356-360, April.
    • Handle: RePEc:inm:oropre:v:25:y:1977:i:2:p:356-360
    DOI: 10.1287/opre.25.2.356
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.25.2.356
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.25.2.356?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

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


    Cited by:

    1. Boronico, Jess S. & Siegel, Philip H., 1998. "Capacity planning for toll roadways incorporating consumer wait time costs," Transportation Research Part A: Policy and Practice, Elsevier, vol. 32(4), pages 297-310, May.
    2. William P. Millhiser & Charu Sinha & Matthew J. Sobel, 2016. "Optimality of the fastest available server policy," Queueing Systems: Theory and Applications, Springer, vol. 84(3), pages 237-263, December.

    More about this item

    Statistics

    Access and download statistics

    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:inm:oropre:v:25:y:1977:i:2:p:356-360. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.