IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v31y1985i8p1011-1018.html
   My bibliography  Save this article

Allocation of Servers for Stochastic Service Stations with One Overflow Station

Author

Listed:
  • Richard Serfozo

    (School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, Georgia 30332)

Abstract

As one of its services, the Bell System provides microwave and cable transmission equipment for the transmission of news, sports and special-event TV programs from sites that do not have permanent transmission facilities. This paper describes a model for determining quantities of this TV equipment for service stations located throughout the country. This is actually a fundamental model for allocating servers (equipment in our case) for a stochastic service system consisting of several multiserver stations with one multiserver overflow station. The flows of customers to the initial stations are independent Poisson processes, and if a customer arrives at a station when all of its servers are busy, it is either served at the overflow station or denied service, depending on whether an overflow-server is available or not. The service times are exponential random variables. There are holding costs for having the servers in the system and costs for the services, depending on where they are done. We present a myopic nonlinear programming algorithm that finds numbers of servers for the stations that serve a desired percentage of customers at near-minimum cost. As part of our analysis, we show how Hayward's and Wilkinson's approximations for the blocking probability at the overflow station extend to heterogeneous service rates.

Suggested Citation

  • Richard Serfozo, 1985. "Allocation of Servers for Stochastic Service Stations with One Overflow Station," Management Science, INFORMS, vol. 31(8), pages 1011-1018, August.
    • Handle: RePEc:inm:ormnsc:v:31:y:1985:i:8:p:1011-1018
    DOI: 10.1287/mnsc.31.8.1011
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.31.8.1011
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.31.8.1011?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
    ---><---

    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:ormnsc:v:31:y:1985:i:8:p:1011-1018. 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.