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

A dual-index rule for managing temporary congestion

Author

Listed:
  • Shaposhnik, Yaron

Abstract

Recent work in healthcare operations provide empirical evidence for the deterioration of service quality due to congestion. Motivated by these findings, we formulate a novel scheduling problem to study how a service provider should prioritize jobs in order to mitigate the impact of temporary congestion-related issues. We analyze the model and show that the optimal policy can be interpreted as a dynamic priority rule that operates in two phases. When the system is overloaded, it is optimal to process jobs according to an index that generalizes Smith’s rule by incorporating the congestion cost. Once the system is no longer overloaded, Smith’s rule becomes optimal. However, the decision about which job to process earlier versus later appears to be challenging (we establish a polynomial time reduction from the partition problem). Our work shows that to respond to congestion, the decision maker should deviate from default scheduling practices and adjust jobs’ urgency at times of congestion to account for potential congestion-related costs. This increases the priority that should be given to shorter jobs (which reduces the time the system is congested), while still taking into account other job characteristics.

Suggested Citation

  • Shaposhnik, Yaron, 2025. "A dual-index rule for managing temporary congestion," European Journal of Operational Research, Elsevier, vol. 323(1), pages 34-44.
  • Handle: RePEc:eee:ejores:v:323:y:2025:i:1:p:34-44
    DOI: 10.1016/j.ejor.2024.11.045
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221724009366
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.ejor.2024.11.045?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.

    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:323:y:2025:i:1:p:34-44. 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: 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.