IDEAS home Printed from https://ideas.repec.org/a/spr/queues/v84y2016i3d10.1007_s11134-016-9502-1.html
   My bibliography  Save this article

Optimality of the fastest available server policy

Author

Listed:
  • William P. Millhiser

    (The City University of New York)

  • Charu Sinha

    (Chapman University)

  • Matthew J. Sobel

    (Case Western Reserve University)

Abstract

We give sufficient conditions under which a policy that assigns customers to the Fastest Available Server, labeled FAS, is optimal among nonidling policies in queueing models with multiple independent Markov-modulated Poisson arrival processes and heterogeneous parallel exponential servers with server-dependent service rates. The criteria are to minimize the long-run average cost per unit time and the expected present value of the costs. We obtain results for loss and delay queueing models with finite- or infinite-capacity buffers under a first-come-first-served priority scheme. We analyze the robustness of the cost structure assumptions that are invoked in the proof of FAS optimality.

Suggested Citation

  • William P. Millhiser & Charu Sinha & Matthew J. Sobel, 2016. "Optimality of the fastest available server policy," Queueing Systems: Theory and Applications, Springer, vol. 84(3), pages 237-263, December.
    • Handle: RePEc:spr:queues:v:84:y:2016:i:3:d:10.1007_s11134-016-9502-1
    DOI: 10.1007/s11134-016-9502-1
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11134-016-9502-1
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s11134-016-9502-1?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.

    References listed on IDEAS

    as
    1. Richard F. Serfozo, 1979. "Technical Note—An Equivalence Between Continuous and Discrete Time Markov Decision Processes," Operations Research, INFORMS, vol. 27(3), pages 616-620, June.
    2. Avishai Mandelbaum & Alexander L. Stolyar, 2004. "Scheduling Flexible Servers with Convex Delay Costs: Heavy-Traffic Optimality of the Generalized cμ-Rule," Operations Research, INFORMS, vol. 52(6), pages 836-855, December.
    3. Matthew J. Sobel, 1982. "The Optimality of Full Service Policies," Operations Research, INFORMS, vol. 30(4), pages 636-649, August.
    4. Linda Green, 1984. "A Multiple Dispatch Queueing Model of Police Patrol Operations," Management Science, INFORMS, vol. 30(6), pages 653-664, June.
    5. Linda Green & Peter Kolesar, 1984. "A Comparison of the Multiple Dispatch and M/M/c Priority Queueing Models of Police Patrol," Management Science, INFORMS, vol. 30(6), pages 665-670, June.
    6. Kiran Seth, 1977. "Technical Note—Optimal Service Policies, Just after Idle Periods, in Two-Server Heterogeneous Queuing Systems," Operations Research, INFORMS, vol. 25(2), pages 356-360, April.
    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. Li Xia & Zhe George Zhang & Quan‐Lin Li, 2022. "A c/μ‐Rule for Job Assignment in Heterogeneous Group‐Server Queues," Production and Operations Management, Production and Operations Management Society, vol. 31(3), pages 1191-1215, March.

    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. P. Daniel Wright & Matthew J. Liberatore & Robert L. Nydick, 2006. "A Survey of Operations Research Models and Applications in Homeland Security," Interfaces, INFORMS, vol. 36(6), pages 514-529, December.
    2. Xiuli Chao & Frank Y. Chen, 2005. "An Optimal Production and Shutdown Strategy when a Supplier Offers an Incentive Program," Manufacturing & Service Operations Management, INFORMS, vol. 7(2), pages 130-143, March.
    3. Yoon, Soovin & Albert, Laura A., 2021. "Dynamic dispatch policies for emergency response with multiple types of vehicles," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 152(C).
    4. Alfonso J. Pedraza-Martinez & Sameer Hasija & Luk N. Van Wassenhove, 2020. "Fleet Coordination in Decentralized Humanitarian Operations Funded by Earmarked Donations," Operations Research, INFORMS, vol. 68(4), pages 984-999, July.
    5. Rabl, Regina & Reuter-Oppermann, Melanie & Jochem, Patrick E.P., 2024. "Charging infrastructure for electric vehicles in New Zealand," Transport Policy, Elsevier, vol. 148(C), pages 124-144.
    6. Diwas S. Kc & Christian Terwiesch, 2009. "Impact of Workload on Service Time and Patient Safety: An Econometric Analysis of Hospital Operations," Management Science, INFORMS, vol. 55(9), pages 1486-1498, September.
    7. Ansari, Sardar & Yoon, Soovin & Albert, Laura A., 2017. "An approximate hypercube model for public service systems with co-located servers and multiple response," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 103(C), pages 143-157.
    8. Linda V. Green & Peter J. Kolesar, 2004. "ANNIVERSARY ARTICLE: Improving Emergency Responsiveness with Management Science," Management Science, INFORMS, vol. 50(8), pages 1001-1014, August.
    9. Schlicher, Loe & Lurkin, Virginie, 2024. "Fighting pickpocketing using a choice-based resource allocation model," European Journal of Operational Research, Elsevier, vol. 315(2), pages 580-595.
    10. Sukanya Samanta & Goutam Sen & Soumya Kanti Ghosh, 2022. "A literature review on police patrolling problems," Annals of Operations Research, Springer, vol. 316(2), pages 1063-1106, September.
    11. Nilay Tan{i}k Argon & Serhan Ziya, 2009. "Priority Assignment Under Imperfect Information on Customer Type Identities," Manufacturing & Service Operations Management, INFORMS, vol. 11(4), pages 674-693, June.
    12. Hall, Randolph, 2000. "Incident Dispatching, Clearance and Delay," Institute of Transportation Studies, Research Reports, Working Papers, Proceedings qt2pp689vn, Institute of Transportation Studies, UC Berkeley.
    13. Drent, Collin & Keizer, Minou Olde & Houtum, Geert-Jan van, 2020. "Dynamic dispatching and repositioning policies for fast-response service networks," European Journal of Operational Research, Elsevier, vol. 285(2), pages 583-598.
    14. Hall, Randolph W., 2002. "Incident dispatching, clearance and delay," Transportation Research Part A: Policy and Practice, Elsevier, vol. 36(1), pages 1-16, January.
    15. Hall, Randolph W., 2001. "Incident Management: Process Analysis and Improvement," Institute of Transportation Studies, Research Reports, Working Papers, Proceedings qt1jf6j37t, Institute of Transportation Studies, UC Berkeley.
    16. Amy R. Ward & Mor Armony, 2013. "Blind Fair Routing in Large-Scale Service Systems with Heterogeneous Customers and Servers," Operations Research, INFORMS, vol. 61(1), pages 228-243, February.
    17. Dimitris Bertsimas & Ioannis Ch. Paschalidis, 2001. "Probabilistic Service Level Guarantees in Make-to-Stock Manufacturing Systems," Operations Research, INFORMS, vol. 49(1), pages 119-133, February.
    18. Achal Bassamboo & J. Michael Harrison & Assaf Zeevi, 2006. "Design and Control of a Large Call Center: Asymptotic Analysis of an LP-Based Method," Operations Research, INFORMS, vol. 54(3), pages 419-435, June.
    19. Allahviranloo, Mahdieh & Recker, Will, 2013. "Daily activity pattern recognition by using support vector machines with multiple classes," Transportation Research Part B: Methodological, Elsevier, vol. 58(C), pages 16-43.
    20. Gabriel Zayas‐Cabán & Emmett J. Lodree & David L. Kaufman, 2020. "Optimal Control of Parallel Queues for Managing Volunteer Convergence," Production and Operations Management, Production and Operations Management Society, vol. 29(10), pages 2268-2288, October.

    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:queues:v:84:y:2016:i:3:d:10.1007_s11134-016-9502-1. 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: 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.