IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v272y2019i1p313-323.html
   My bibliography  Save this article

Optimising key performance indicator adherence with application to emergency department congestion

Author

Listed:
  • Li, Na
  • Stanford, David A.
  • Sharif, Azaz B.
  • Caron, Richard J.
  • Pardhan, Alim

Abstract

Many operational queueing systems must adhere to systems of Key Performance Indicators (KPIs), each comprising a waiting time limit and a level of compliance specifying the minimal fraction of customers that must meet the standard. KPIs are frequently employed as measures of system performance in health care settings. The primary flaw with KPIs is that they represent a system of constraints with no objective function. KPIs say nothing about customers who exceed their limit, so long as such occurrences are sufficiently rare, when in fact customers who miss their time limit in a health care setting are of greater importance, not lesser. We address this flaw by minimising the mean number of customers present who have exceeded their respective limits; we consider also weighted averages of the numbers in excess for each class. We then show that one logical service discipline to achieve this goal is the Accumulating Priority Queueing (APQ) discipline. We carry out numerical examples to investigate the utility of our method. We then apply the optimisation approach to the case of an Emergency Department in Southern Ontario, Canada.

Suggested Citation

  • Li, Na & Stanford, David A. & Sharif, Azaz B. & Caron, Richard J. & Pardhan, Alim, 2019. "Optimising key performance indicator adherence with application to emergency department congestion," European Journal of Operational Research, Elsevier, vol. 272(1), pages 313-323.
    • Handle: RePEc:eee:ejores:v:272:y:2019:i:1:p:313-323
    DOI: 10.1016/j.ejor.2018.06.048
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221718306003
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2018.06.048?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. Joseph M. Milner & Tava Lennon Olsen, 2008. "Service-Level Agreements in Call Centers: Perils and Prescriptions," Management Science, INFORMS, vol. 54(2), pages 238-252, February.
    2. Sabri Çelik & Costis Maglaras, 2008. "Dynamic Pricing and Lead-Time Quotation for a Multiclass Make-to-Order Queue," Management Science, INFORMS, vol. 54(6), pages 1132-1146, June.
    3. Li, Na & Stanford, David A., 2016. "Multi-server accumulating priority queues with heterogeneous servers," European Journal of Operational Research, Elsevier, vol. 252(3), pages 866-878.
    4. Mustafa Akan & Barı ş Ata & Tava Olsen, 2012. "Congestion-Based Lead-Time Quotation for Heterogenous Customers with Convex-Concave Delay Costs: Optimality of a Cost-Balancing Policy Based on Convex Hull Functions," Operations Research, INFORMS, vol. 60(6), pages 1505-1519, December.
    5. D. P. Gaver, 1966. "Observing Stochastic Processes, and Approximate Transform Inversion," Operations Research, INFORMS, vol. 14(3), pages 444-459, June.
    6. Pinar Keskinocak & R. Ravi & Sridhar Tayur, 2001. "Scheduling and Reliable Lead-Time Quotation for Orders with Availability Intervals and Lead-Time Sensitive Revenues," Management Science, INFORMS, vol. 47(2), pages 264-279, 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. Amir Elalouf & Guy Wachtel, 2022. "Queueing Problems in Emergency Departments: A Review of Practical Approaches and Research Methodologies," SN Operations Research Forum, Springer, vol. 3(1), pages 1-46, March.
    2. Joris Walraevens & Thomas Giel & Stijn Vuyst & Sabine Wittevrongel, 2022. "Asymptotics of waiting time distributions in the accumulating priority queue," Queueing Systems: Theory and Applications, Springer, vol. 101(3), pages 221-244, August.
    3. Lien Vanbrabant & Kris Braekers & Katrien Ramaekers, 2021. "Improving emergency department performance by revising the patient–physician assignment process," Flexible Services and Manufacturing Journal, Springer, vol. 33(3), pages 783-845, September.

    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. Vibhanshu Abhishek & Mustafa Dogan & Alexandre Jacquillat, 2021. "Strategic Timing and Dynamic Pricing for Online Resource Allocation," Management Science, INFORMS, vol. 67(8), pages 4880-4907, August.
    2. Vasiliki Kostami, 2020. "Price and Lead time Disclosure Strategies in Inventory Systems," Production and Operations Management, Production and Operations Management Society, vol. 29(12), pages 2760-2788, December.
    3. Barış Ata & Tava Lennon Olsen, 2009. "Near-Optimal Dynamic Lead-Time Quotation and Scheduling Under Convex-Concave Customer Delay Costs," Operations Research, INFORMS, vol. 57(3), pages 753-768, June.
    4. Gökçe Kahveciog̃lu & Barış Balcıog̃lu, 2016. "Coping with production time variability via dynamic lead-time quotation," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 38(4), pages 877-898, October.
    5. A. Baykal Hafızoğlu & Esma S. Gel & Pınar Keskinocak, 2016. "Price and Lead Time Quotation for Contract and Spot Customers," Operations Research, INFORMS, vol. 64(2), pages 406-415, April.
    6. Mustafa Akan & Barı ş Ata & Tava Olsen, 2012. "Congestion-Based Lead-Time Quotation for Heterogenous Customers with Convex-Concave Delay Costs: Optimality of a Cost-Balancing Policy Based on Convex Hull Functions," Operations Research, INFORMS, vol. 60(6), pages 1505-1519, December.
    7. Tianhu Deng & Ying‐Ju Chen & Zuo‐Jun Max Shen, 2015. "Optimal pricing and scheduling control of product shipping," Naval Research Logistics (NRL), John Wiley & Sons, vol. 62(3), pages 215-227, April.
    8. Hongyan Li & Joern Meissner, 2018. "Capacity optimization and competition with cyclical and lead-time-dependent demands," Annals of Operations Research, Springer, vol. 271(2), pages 737-763, December.
    9. A. Baykal Hafızoğlu & Esma S. Gel & Pınar Keskinocak, 2013. "Expected Tardiness Computations in Multiclass Priority M / M / c Queues," INFORMS Journal on Computing, INFORMS, vol. 25(2), pages 364-376, May.
    10. Nekoiemehr, Nooshin & Zhang, Guoqing & Selvarajah, Esaignani, 2019. "Due date quotation in a dual-channel supply chain," International Journal of Production Economics, Elsevier, vol. 215(C), pages 102-111.
    11. Niyirora, Jerome & Zhuang, Jun, 2017. "Fluid approximations and control of queues in emergency departments," European Journal of Operational Research, Elsevier, vol. 261(3), pages 1110-1124.
    12. Andrea Bastianin & Marzio Galeotti & Matteo Manera, 2019. "Statistical and economic evaluation of time series models for forecasting arrivals at call centers," Empirical Economics, Springer, vol. 57(3), pages 923-955, September.
    13. Leippold, Markus & Vasiljević, Nikola, 2017. "Pricing and disentanglement of American puts in the hyper-exponential jump-diffusion model," Journal of Banking & Finance, Elsevier, vol. 77(C), pages 78-94.
    14. Slotnick, Susan A., 2011. "Order acceptance and scheduling: A taxonomy and review," European Journal of Operational Research, Elsevier, vol. 212(1), pages 1-11, July.
    15. Kimura, Toshikazu, 2008. "Valuing finite-lived Russian options," European Journal of Operational Research, Elsevier, vol. 189(2), pages 363-374, September.
    16. Dengpan Liu & Sumit Sarkar & Chelliah Sriskandarajah, 2010. "Resource Allocation Policies for Personalization in Content Delivery Sites," Information Systems Research, INFORMS, vol. 21(2), pages 227-248, June.
    17. Feifeng Zheng & E. Zhang & Yinfeng Xu & Wei-Chiang Hong, 2014. "Competitive analysis for make-to-order scheduling with reliable lead time quotation," Journal of Combinatorial Optimization, Springer, vol. 27(1), pages 182-198, January.
    18. Tanja Mlinar & Philippe Chevalier, 2016. "Pooling heterogeneous products for manufacturing environments," 4OR, Springer, vol. 14(2), pages 173-200, June.
    19. Mustafa Akan & Bar{i}c{s} Ata & Martin A. Lariviere, 2011. "Asymmetric Information and Economies of Scale in Service Contracting," Manufacturing & Service Operations Management, INFORMS, vol. 13(1), pages 58-72, September.
    20. Christopher Dance & Alexei Gaivoronski, 2012. "Stochastic optimization for real time service capacity allocation under random service demand," Annals of Operations Research, Springer, vol. 193(1), pages 221-253, March.

    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:eee:ejores:v:272:y:2019:i:1:p:313-323. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.