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

Finite capacity single-server queue with Poisson input, general service and delayed renovation

Author

Listed:
  • Konovalov, Mikhail
  • Razumchik, Rostislav

Abstract

This paper is devoted to the performance evaluation of the finite–capacity single-server queue with Poisson input and general service times, which is equipped with the novel queue-control mechanism — called renovation with delay. Renovation implies that each customer, when leaving the system upon its service completion, may also remove customers waiting in the queue. The number of customers to be removed is selected each time independently of the previous decisions and probabilistically based on the given probability distribution. The renovation with the delay considered in this paper means that the system must accumulate the (known) fixed number of service completions before the next renovation can be triggered. First in the literature numerical evidence is given, that the long-run performance of the system with such delayed renovation mechanism can be similar to that of the systems with the well-known active queue management mechanisms such as random early detection, at least in its basic version. The key stationary performance characteristics reported are the loss probability and the mean number of customers in the system. The unified analytical framework for the computation of the key performance characteristics, which is of independent interest, is also developed.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:ejores:v:304:y:2023:i:3:p:1075-1083
    DOI: 10.1016/j.ejor.2022.05.047
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221722004490
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2022.05.047?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. Pawel Mrozowski & Andrzej Chydzinski, 2018. "Queues with Dropping Functions and Autocorrelated Arrivals," Methodology and Computing in Applied Probability, Springer, vol. 20(1), pages 97-115, March.
    2. Brill, P.H. & Huang, M.L. & Hlynka, M., 2020. "On the service time in a workload-barrier M/G/1 queue with accepted and blocked customers," European Journal of Operational Research, Elsevier, vol. 283(1), pages 235-243.
    3. White, D. J., 1980. "Notes in decision theory: Optimality and efficiency II," European Journal of Operational Research, Elsevier, vol. 4(6), pages 426-427, June.
    4. White, D. J., 1980. "Optimality and efficiency I," European Journal of Operational Research, Elsevier, vol. 4(5), pages 346-355, May.
    5. Andrzej Chydzinski & Pawel Mrozowski, 2016. "Queues with Dropping Functions and General Arrival Processes," PLOS ONE, Public Library of Science, vol. 11(3), pages 1-23, March.
    6. Vetschera, Rudolf, 1991. "A note on scalarizing functions under changing sets of criteria," European Journal of Operational Research, Elsevier, vol. 52(1), pages 113-118, May.
    7. Haji, Babak & Ross, Sheldon, 2020. "Minimizing expected discounted cost in a queueing loss model with discriminating arrivals," European Journal of Operational Research, Elsevier, vol. 282(2), pages 593-601.
    8. Andrzej Chydzinski & Blazej Adamczyk, 2019. "Queues with the dropping function and general service time," PLOS ONE, Public Library of Science, vol. 14(7), pages 1-21, July.
    9. Stidham, Shaler, 1974. "Stochastic clearing systems," Stochastic Processes and their Applications, Elsevier, vol. 2(1), pages 85-113, January.
    10. Legros, Benjamin, 2020. "Late-rejection, a strategy to perform an overflow policy," European Journal of Operational Research, Elsevier, vol. 281(1), pages 66-76.
    Full references (including those not matched with items on IDEAS)

    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. Andrzej Chydzinski, 2021. "On the stability of queues with the dropping function," PLOS ONE, Public Library of Science, vol. 16(11), pages 1-16, November.
    2. Chydzinski, Andrzej & Adamczyk, Blazej, 2020. "Response time of the queue with the dropping function," Applied Mathematics and Computation, Elsevier, vol. 377(C).
    3. Gianni Bosi & Magalì Zuanon, 2019. "Upper Semicontinuous Representability of Maximal Elements for Nontransitive Preferences," Journal of Optimization Theory and Applications, Springer, vol. 181(3), pages 758-765, June.
    4. Pedro Hack & Daniel A. Braun & Sebastian Gottwald, 2023. "The classification of preordered spaces in terms of monotones: complexity and optimization," Theory and Decision, Springer, vol. 94(4), pages 693-720, May.
    5. Podinovski, Vladislav V., 2013. "Non-dominance and potential optimality for partial preference relations," European Journal of Operational Research, Elsevier, vol. 229(2), pages 482-486.
    6. Pedro Hack & Daniel A. Braun & Sebastian Gottwald, 2022. "Representing preorders with injective monotones," Theory and Decision, Springer, vol. 93(4), pages 663-690, November.
    7. Marek Barczyk & Andrzej Chydzinski, 2022. "AQM based on the queue length: A real-network study," PLOS ONE, Public Library of Science, vol. 17(2), pages 1-21, February.
    8. Legros, Benjamin, 2021. "Routing analyses for call centers with human and automated services," International Journal of Production Economics, Elsevier, vol. 240(C).
    9. Antonis Economou & Athanasia Manou, 2013. "Equilibrium balking strategies for a clearing queueing system in alternating environment," Annals of Operations Research, Springer, vol. 208(1), pages 489-514, September.
    10. Jansen, J.B., 1998. "Service and inventory models subject to a delay-limit," Other publications TiSEM d51b1fee-e8a2-46bc-b331-1, Tilburg University, School of Economics and Management.
    11. Menachem Berg & Frank van der Duyn Schouten & Jorg Jansen, 1998. "Optimal Batch Provisioning to Customers Subject to a Delay-Limit," Management Science, INFORMS, vol. 44(5), pages 684-697, May.
    12. Bu, Qihui & Sun, Yun & Chai, Xudong & Liu, Liwei, 2020. "Strategic behavior and social optimization in a clearing queueing system with N-policy and stochastic restarting scheme," Applied Mathematics and Computation, Elsevier, vol. 381(C).
    13. Berg, M. & van der Duyn Schouten, F.A. & Jansen, J.B., 1996. "Optimal Service Policies to Remote Customers with Delay-Limits," Other publications TiSEM 94a53598-1da9-4f29-a91d-a, Tilburg University, School of Economics and Management.
    14. Germs, Remco & Van Foreest, Nicky D. & Kilic, Onur A., 2016. "Optimal policies for production-clearing systems under continuous-review," European Journal of Operational Research, Elsevier, vol. 255(3), pages 747-757.
    15. Berg, M. & van der Duyn Schouten, F.A. & Jansen, J.B., 1996. "Optimal Service Policies to Remote Customers with Delay-Limits," Discussion Paper 1996-37, Tilburg University, Center for Economic Research.
    16. Royi Jacobovic & Offer Kella, 2019. "Asymptotic independence of regenerative processes with a special dependence structure," Queueing Systems: Theory and Applications, Springer, vol. 93(1), pages 139-152, October.
    17. Banu Yüksel Özkaya & Ülkü Gürler & Emre Berk, 2006. "The stochastic joint replenishment problem: A new policy, analysis, and insights," Naval Research Logistics (NRL), John Wiley & Sons, vol. 53(6), pages 525-546, September.
    18. Oded Berman & Mahmut Parlar & David Perry & M. J. M. Posner, 2005. "Production/Clearing Models Under Continuous and Sporadic Reviews," Methodology and Computing in Applied Probability, Springer, vol. 7(2), pages 203-224, June.
    19. Qi‐Ming He & James H. Bookbinder & Qishu Cai, 2020. "Optimal policies for stochastic clearing systems with time‐dependent delay penalties," Naval Research Logistics (NRL), John Wiley & Sons, vol. 67(7), pages 487-502, October.
    20. Benjamin Legros, 2021. "Age-based Markovian approximation of the G/M/1 queue," Post-Print hal-03605431, HAL.

    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:304:y:2023:i:3:p:1075-1083. 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.