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

Admission Policies in Loss Queueing Models with Heterogeneous Arrivals

Author

Listed:
  • E. Carrizosa

    (Facultad de Matemáticas, Universidad de Sevilla, Tarfia s/n, 41012 Sevilla, Spain)

  • E. Conde

    (Facultad de Matemáticas, Universidad de Sevilla, Tarfia s/n, 41012 Sevilla, Spain)

  • M. Muñoz-Márquez

    (Departamento de Matemáticas, Universidad de Cádiz, Sacramento 82, Escuela Politécnica de Cádiz, 11002 Cádiz, Spain)

Abstract

In this paper we consider a loss system where the arrivals can be classified into different groups according to their arrival rate and expected service time. While the standard admission policy consists of rejecting only those customers who arrive when all servers are busy, we address the problem of finding the optimal static admission policy (with respect to a given reward structure) when customers can be discriminated according to the group they belong to, thus customers of some groups might be automatically rejected (even if some servers remain idle) in order to enhance the global efficiency of the system. The optimality of a c\mu -rule is shown, from which finite-time algorithms for the one- and two-server cases are derived.

Suggested Citation

  • 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.
    • Handle: RePEc:inm:ormnsc:v:44:y:1998:i:3:p:311-320
    DOI: 10.1287/mnsc.44.3.311
    as

    Download full text from publisher

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

    References listed on IDEAS

    as
    1. Arie Harel, 1990. "Convexity Properties of the Erlang Loss Formula," Operations Research, INFORMS, vol. 38(3), pages 499-505, June.
    2. Rajan Batta, 1988. "Single Server Queueing-Location Models with Rejection," Transportation Science, INFORMS, vol. 22(3), pages 209-216, August.
    3. Kaul, R. N. & Kaur, Surjeet, 1982. "Generalizations of convex and related functions," European Journal of Operational Research, Elsevier, vol. 9(4), pages 369-377, April.
    4. MILLER, Bruce L., 1969. "A queueing reward system with several customer classes," LIDAM Reprints CORE 41, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    5. Bruce L. Miller, 1969. "A Queueing Reward System with Several Customer Classes," Management Science, INFORMS, vol. 16(3), pages 234-245, November.
    6. Viscolani, Bruno, 1993. "Optimal design of a multiservice system: The line-penalty problem," European Journal of Operational Research, Elsevier, vol. 67(2), pages 242-247, June.
    7. J. N. Hooker & R. S. Garfinkel & C. K. Chen, 1991. "Finite Dominating Sets for Network Location Problems," Operations Research, INFORMS, vol. 39(1), pages 100-118, February.
    8. Paul H. Zipkin, 1986. "Models for Design and Control of Stochastic, Multi-Item Batch Production Systems," Operations Research, INFORMS, vol. 34(1), pages 91-104, February.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Papier, Felix & Thonemann, Ulrich W., 2011. "Capacity rationing in rental systems with two customer classes and batch arrivals," Omega, Elsevier, vol. 39(1), pages 73-85, January.
    2. Albareda-Sambola, Maria & Fernández, Elena & Saldanha-da-Gama, Francisco, 2011. "The facility location problem with Bernoulli demands," Omega, Elsevier, vol. 39(3), pages 335-345, June.
    3. Linda V. Green & Sergei Savin & Ben Wang, 2006. "Managing Patient Service in a Diagnostic Medical Facility," Operations Research, INFORMS, vol. 54(1), pages 11-25, February.
    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. Doǧan A. Serel & Erdal Erel, 2008. "Coordination of staffing and pricing decisions in a service firm," Applied Stochastic Models in Business and Industry, John Wiley & Sons, vol. 24(4), pages 307-323, July.
    6. Felipe Caro & David Simchi-Levi, 2012. "Optimal static pricing for a tree network," Annals of Operations Research, Springer, vol. 196(1), pages 137-152, July.
    7. Demet Batur & Jennifer K. Ryan & Zhongyuan Zhao & Mehmet C. Vuran, 2019. "Dynamic Pricing of Wireless Internet Based on Usage and Stochastically Changing Capacity," Manufacturing & Service Operations Management, INFORMS, vol. 21(4), pages 833-852, October.
    8. Serhan Ziya & Hayriye Ayhan & Robert D. Foley, 2008. "A note on optimal pricing for finite capacity queueing systems with multiple customer classes," Naval Research Logistics (NRL), John Wiley & Sons, vol. 55(5), pages 412-418, August.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Kyle Y. Lin, 2003. "Decentralized admission control of a queueing system: A game‐theoretic model," Naval Research Logistics (NRL), John Wiley & Sons, vol. 50(7), pages 702-718, October.
    2. Kyle Y. Lin & Sheldon M. Ross, 2003. "Admission Control with Incomplete Information of a Queueing System," Operations Research, INFORMS, vol. 51(4), pages 645-654, August.
    3. Davide Mezzogori & Giovanni Romagnoli & Francesco Zammori, 2021. "Defining accurate delivery dates in make to order job-shops managed by workload control," Flexible Services and Manufacturing Journal, Springer, vol. 33(4), pages 956-991, December.
    4. van Jaarsveld, W.L. & Dekker, R., 2009. "Finding optimal policies in the (S - 1, S ) lost sales inventory model with multiple demand classes," Econometric Institute Research Papers EI 2009-14, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    5. van Wijk, A.C.C. & Adan, I.J.B.F. & van Houtum, G.J., 2012. "Approximate evaluation of multi-location inventory models with lateral transshipments and hold back levels," European Journal of Operational Research, Elsevier, vol. 218(3), pages 624-635.
    6. Li, Xueping & Wang, Jiao & Sawhney, Rapinder, 2012. "Reinforcement learning for joint pricing, lead-time and scheduling decisions in make-to-order systems," European Journal of Operational Research, Elsevier, vol. 221(1), pages 99-109.
    7. Hessam Bavafa & Anne Canamucio & Steven C. Marcus & Christian Terwiesch & Rachel M. Werner, 2022. "Capacity Rationing in Primary Care: Provider Availability Shocks and Channel Diversion," Management Science, INFORMS, vol. 68(4), pages 2842-2859, April.
    8. Leon Yang Chu & Zhixi Wan & Dongyuan Zhan, 2018. "Harnessing the Double-edged Sword via Routing: Information Provision on Ride-hailing Platforms," Working Papers 18-04, NET Institute.
    9. Xufeng Yang & Wen Jiao & Juliang Zhang & Hong Yan, 2022. "Capacity management for a leasing system with different equipment and batch demands," Production and Operations Management, Production and Operations Management Society, vol. 31(7), pages 3004-3020, July.
    10. Retsef Levi & Ana Radovanović, 2010. "Provably Near-Optimal LP-Based Policies for Revenue Management in Systems with Reusable Resources," Operations Research, INFORMS, vol. 58(2), pages 503-507, April.
    11. Apurva Jain & Kamran Moinzadeh & Aussadavut Dumrongsiri, 2015. "Priority Allocation in a Rental Model with Decreasing Demand," Manufacturing & Service Operations Management, INFORMS, vol. 17(2), pages 236-248, May.
    12. Huh, Woonghee Tim & Lee, Jaywon & Park, Heesang & Park, Kun Soo, 2019. "The potty parity problem: Towards gender equality at restrooms in business facilities," Socio-Economic Planning Sciences, Elsevier, vol. 68(C).
    13. Papier, Felix & Thonemann, Ulrich W., 2011. "Capacity rationing in rental systems with two customer classes and batch arrivals," Omega, Elsevier, vol. 39(1), pages 73-85, January.
    14. Demet Batur & Jennifer K. Ryan & Zhongyuan Zhao & Mehmet C. Vuran, 2019. "Dynamic Pricing of Wireless Internet Based on Usage and Stochastically Changing Capacity," Manufacturing & Service Operations Management, INFORMS, vol. 21(4), pages 833-852, October.
    15. Sergei V. Savin & Morris A. Cohen & Noah Gans & Ziv Katalan, 2005. "Capacity Management in Rental Businesses with Two Customer Bases," Operations Research, INFORMS, vol. 53(4), pages 617-631, August.
    16. Eugene A. Feinberg & Fenghsu Yang, 2016. "Optimal pricing for a GI/M/k/N queue with several customer types and holding costs," Queueing Systems: Theory and Applications, Springer, vol. 82(1), pages 103-120, February.
    17. Xufeng Yang & Juliang Zhang & Wen Jiao & Hong Yan, 2023. "Optimal Capacity Rationing Policy for a Container Leasing System with Multiple Kinds of Customers and Substitutable Containers," Management Science, INFORMS, vol. 69(3), pages 1468-1485, March.
    18. Song-Hee Kim & Carri W. Chan & Marcelo Olivares & Gabriel Escobar, 2015. "ICU Admission Control: An Empirical Study of Capacity Allocation and Its Implication for Patient Outcomes," Management Science, INFORMS, vol. 61(1), pages 19-38, January.
    19. Nadav Lavi & Hanoch Levy, 2020. "Admit or preserve? Addressing server failures in cloud computing task management," Queueing Systems: Theory and Applications, Springer, vol. 94(3), pages 279-325, April.
    20. Koeleman, P.M. & Bhulai, S. & van Meersbergen, M., 2012. "Optimal patient and personnel scheduling policies for care-at-home service facilities," European Journal of Operational Research, Elsevier, vol. 219(3), pages 557-563.

    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:44:y:1998:i:3:p:311-320. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.