IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v111y2002i1p35-5010.1023-a1020989316737.html
   My bibliography  Save this article

Location–Allocation of Multiple-Server Service Centers with Constrained Queues or Waiting Times

Author

Listed:
  • Vladimir Marianov
  • Daniel Serra

Abstract

Recently, the authors have formulated new models for the location of congested facilities, so to maximize population covered by service with short queues or waiting time. In this paper, we present an extension of these models, which seeks to cover all population and includes server allocation to the facilities. This new model is intended for the design of service networks, including health and EMS services, banking or distributed ticket-selling services. As opposed to the previous Maximal Covering model, the model presented here is a Set Covering formulation, which locates the least number of facilities and allocates the minimum number of servers (clerks, tellers, machines) to them, so to minimize queuing effects. For a better understanding, a first model is presented, in which the number of servers allocated to each facility is fixed. We then formulate a Location Set Covering model with a variable (optimal) number of servers per service center (or facility). A new heuristic, with good performance on a 55-node network, is developed and tested. Copyright Kluwer Academic Publishers 2002

Suggested Citation

  • Vladimir Marianov & Daniel Serra, 2002. "Location–Allocation of Multiple-Server Service Centers with Constrained Queues or Waiting Times," Annals of Operations Research, Springer, vol. 111(1), pages 35-50, March.
    • Handle: RePEc:spr:annopr:v:111:y:2002:i:1:p:35-50:10.1023/a:1020989316737
    DOI: 10.1023/A:1020989316737
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1023/A:1020989316737
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1023/A:1020989316737?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
    ---><---

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

    More about this item

    Keywords

    queuing; heuristics; location;
    All these keywords.

    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:spr:annopr:v:111:y:2002:i:1:p:35-50:10.1023/a:1020989316737. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.