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

Late-rejection, a strategy to perform an overflow policy

Author

Listed:
  • Legros, Benjamin

Abstract

Motivated by overflow policies implemented in service systems, we consider a multi-server queue with customers’ abandonment where rejection control is exercised on customers currently waiting in the queue. Our aim is to find a good balance between conflicting goals, namely, the rate of rejected customers and a cost function which may involve wait and abandonment metrics like percentiles of the waiting time or rate of abandonment. We develop a Markov decision process approach where the waiting time of the first customer in line is used in a discretized form to define the system state. We show that a time-based threshold policy is optimal, and develop a procedure to compute the optimal threshold. Our analysis explains some known behaviors in practice. For instance, if the cost function is constant in the system state like with wait percentiles, then the optimal threshold is one of the time limits defining the percentiles. Also, abandonment is shown to have beneficial or detrimental effect depending on the system manager’s objective.

Suggested Citation

  • Legros, Benjamin, 2020. "Late-rejection, a strategy to perform an overflow policy," European Journal of Operational Research, Elsevier, vol. 281(1), pages 66-76.
    • Handle: RePEc:eee:ejores:v:281:y:2020:i:1:p:66-76
    DOI: 10.1016/j.ejor.2019.08.037
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221719307076
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2019.08.037?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.

    Citations

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


    Cited by:

    1. Legros, Benjamin, 2021. "Routing analyses for call centers with human and automated services," International Journal of Production Economics, Elsevier, vol. 240(C).
    2. Benjamin Legros, 2021. "Routing analyses for call centers with human and automated services," Post-Print hal-03605426, HAL.
    3. Konovalov, Mikhail & Razumchik, Rostislav, 2023. "Finite capacity single-server queue with Poisson input, general service and delayed renovation," European Journal of Operational Research, Elsevier, vol. 304(3), pages 1075-1083.
    4. Benjamin Legros, 2021. "Age-based Markovian approximation of the G/M/1 queue," Post-Print hal-03605431, HAL.
    5. Kouki, Chaaben & Legros, Benjamin & Zied Babai, M. & Jouini, Oualid, 2020. "Analysis of base-stock perishable inventory systems with general lifetime and lead-time," European Journal of Operational Research, Elsevier, vol. 287(3), pages 901-915.
    6. Liu, Jian & Chen, Jian & Bo, Rui & Meng, Fanlin & Xu, Yong & Li, Peng, 2023. "Increases or discounts: Price strategies based on customers’ patience times," European Journal of Operational Research, Elsevier, vol. 305(2), pages 722-737.

    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:281:y:2020:i:1:p:66-76. 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.