IDEAS home Printed from https://ideas.repec.org/a/inm/ortrsc/v22y1988i3p209-216.html
   My bibliography  Save this article

Single Server Queueing-Location Models with Rejection

Author

Listed:
  • Rajan Batta

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

Abstract

This paper considers the problem of locating a single server on a network while explicitly accounting for queueing of calls for service. Calls from a node can either all be accepted or all be rejected by the service system. Two models are considered. In the first model a call can be rejected independent of the state of the system when the call arrives. In the second model, an arriving call can be rejected only if it finds the server busy. The queueing systems are analyzed for both models. A greedy heuristic is developed which, parametrically in the arrival rate of calls, determines the location of the server and the rejection strategies at nodes. Extreme case analysis with respect to the arrival rate is investigated. A numerical example illustrates our results. Our major observation is that the rejection strategies for calls are dependent on the arrival rate, and the choice of model.

Suggested Citation

  • Rajan Batta, 1988. "Single Server Queueing-Location Models with Rejection," Transportation Science, INFORMS, vol. 22(3), pages 209-216, August.
    • Handle: RePEc:inm:ortrsc:v:22:y:1988:i:3:p:209-216
    DOI: 10.1287/trsc.22.3.209
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.22.3.209
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.22.3.209?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. V Marianov & T B Boffey & R D Galvão, 2009. "Optimal location of multi-server congestible facilities operating as M/E r /m/N queues," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(5), pages 674-684, May.
    2. Gregory Dobson & Euthemia Stavrulaki, 2007. "Simultaneous price, location, and capacity decisions on a line of time‐sensitive customers," Naval Research Logistics (NRL), John Wiley & Sons, vol. 54(1), pages 1-10, February.
    3. Chen, Heng & Hu, Zhangchen & Solak, Senay, 2021. "Improved delivery policies for future drone-based delivery systems," European Journal of Operational Research, Elsevier, vol. 294(3), pages 1181-1201.
    4. Elena Fernández & Yolanda Hinojosa & Justo Puerto, 2005. "Filtering Policies in Loss Queuing Network Location Problems," Annals of Operations Research, Springer, vol. 136(1), pages 259-283, April.
    5. E. Carrizosa & E. Conde & M. Muñoz-Márquez, 1998. "Admission Policies in Loss Queueing Models with Heterogeneous Arrivals," Management Science, INFORMS, vol. 44(3), pages 311-320, March.
    6. Vladimir Marianov & Daniel Serra, 1996. "Probabilistic maximal covering location-allocation models with constrained waiting time or queue length for congested systems," Economics Working Papers 177, Department of Economics and Business, Universitat Pompeu Fabra.

    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:ortrsc:v:22:y:1988:i:3:p:209-216. 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.