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

Technical Note—The Stochastic Queue Median Over a Finite Discrete Set

Author

Listed:
  • Rajan Batta

    (State University of New York at Buffalo, Buffalo, New York)

Abstract

Many practical location decision problems require facility locations to be restricted to a finite set of points. Quite often such restrictions arise from natural constraints that are specific to the application setting. Motivated by such situations, this paper examines the Stochastic Queue Median (SQM) model of Berman, Larson and Chiu, where potential facility locations are restricted to a finite set of discrete points. An efficient algorithm is presented to solve for the optimal facility location parametrically in the systemwide arrival rate of calls. The complexity of the algorithm and a worst case analysis for the model formulation are also discussed.

Suggested Citation

  • Rajan Batta, 1989. "Technical Note—The Stochastic Queue Median Over a Finite Discrete Set," Operations Research, INFORMS, vol. 37(4), pages 648-652, August.
    • Handle: RePEc:inm:oropre:v:37:y:1989:i:4:p:648-652
    DOI: 10.1287/opre.37.4.648
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.37.4.648
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.37.4.648?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. Caio Vitor Beojone & Regiane Máximo de Souza & Ana Paula Iannoni, 2021. "An Efficient Exact Hypercube Model with Fully Dedicated Servers," Transportation Science, INFORMS, vol. 55(1), pages 222-237, 1-2.
    2. Mehrdad Moshtagh & Jafar Fathali & James MacGregor Smith & Nezam Mahdavi-Amiri, 2019. "Finding an optimal core on a tree network with M/G/c/c state-dependent queues," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 89(1), pages 115-142, February.

    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:37:y:1989:i:4:p:648-652. 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.