IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v310y2022i2d10.1007_s10479-020-03903-2.html
   My bibliography  Save this article

A successive censoring algorithm for a system of connected LDQBD-processes

Author

Listed:
  • Niek Baer

    (University of Twente)

  • Ahmad Al Hanbali

    (King Fahd University of Petroleum and Minerals)

  • Richard J. Boucherie

    (University of Twente)

  • Jan-Kees van Ommeren

    (University of Twente)

Abstract

We consider a Markov Chain in which the state space is partitioned into sets where both transitions within sets and between sets have a special structure. Transitions within each set constitute a finite level dependent quasi-birth-and-death-process (LDQBD), and transitions between sets are restricted to six types of transitions. These latter types are needed to preserve the sets structure in the reduction step of our algorithm. Specifically, we present a successive censoring algorithm, based on matrix analytic methods, to obtain the stationary distribution of this system of connected LDQBD-processes.

Suggested Citation

  • Niek Baer & Ahmad Al Hanbali & Richard J. Boucherie & Jan-Kees van Ommeren, 2022. "A successive censoring algorithm for a system of connected LDQBD-processes," Annals of Operations Research, Springer, vol. 310(2), pages 389-410, March.
    • Handle: RePEc:spr:annopr:v:310:y:2022:i:2:d:10.1007_s10479-020-03903-2
    DOI: 10.1007/s10479-020-03903-2
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-020-03903-2
    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/s10479-020-03903-2?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. Niek Baer & Richard J. Boucherie & Jan-Kees C. W. van Ommeren, 2019. "Threshold Queueing to Describe the Fundamental Diagram of Uninterrupted Traffic," Transportation Science, INFORMS, vol. 53(2), pages 585-596, March.
    2. Yang Woo Shin, 2009. "Fundamental Matrix Of Transient Qbd Generator With Finite States And Level Dependent Transitions," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 26(05), pages 697-714.
    3. Dwi Ertiningsih & Michael N. Katehakis & Laurens C. Smit & Flora M. Spieksma, 2019. "Level product form QSF processes and an analysis of queues with Coxian interarrival distribution," Naval Research Logistics (NRL), John Wiley & Sons, vol. 66(1), pages 57-72, February.
    4. F. V. Lu & R. F. Serfozo, 1984. "M / M /1 Queueing Decision Processes with Monotone Hysteretic Optimal Policies," Operations Research, INFORMS, vol. 32(5), pages 1116-1132, October.
    5. Brion N. Feinberg & Samuel S. Chiu, 1987. "A Method to Calculate Steady-State Distributions of Large Markov Chains by Aggregating States," Operations Research, INFORMS, vol. 35(2), pages 282-290, April.
    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. Kim, Eungab, 2005. "Optimal inventory replenishment policy for a queueing system with finite waiting room capacity," European Journal of Operational Research, Elsevier, vol. 161(1), pages 256-274, February.
    2. Sunggon Kim & Jongwoo Kim & Eui Lee, 2006. "Stationary distribution of queue length in G / M / 1 queue with two-stage service policy," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 64(3), pages 467-480, December.
    3. Papadopoulos, H. T. & Heavey, C., 1996. "Queueing theory in manufacturing systems analysis and design: A classification of models for production and transfer lines," European Journal of Operational Research, Elsevier, vol. 92(1), pages 1-27, July.
    4. Chenxi Liu & Nan Chen & Jianing Yang, 2015. "New method for multi-state system reliability analysis based on linear algebraic representation," Journal of Risk and Reliability, , vol. 229(5), pages 469-482, October.
    5. Bao, Yue & Verhoef, Erik T. & Koster, Paul, 2021. "Leaving the tub: The nature and dynamics of hypercongestion in a bathtub model with a restricted downstream exit," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 152(C).
    6. Foreest, N. D. van & Wijngaard, J., 2010. "On the Optimal Policy for the Single-product Inventory Problem with Set-up Cost and a Restricted Production Capacity," Research Report 10005, University of Groningen, Research Institute SOM (Systems, Organisations and Management).
    7. Boronico, Jess S. & Siegel, Philip H., 1998. "Capacity planning for toll roadways incorporating consumer wait time costs," Transportation Research Part A: Policy and Practice, Elsevier, vol. 32(4), pages 297-310, May.
    8. Terekhov, Daria & Christopher Beck, J., 2009. "An extended queueing control model for facilities with front room and back room operations and mixed-skilled workers," European Journal of Operational Research, Elsevier, vol. 198(1), pages 223-231, October.
    9. repec:dgr:rugsom:10005 is not listed on IDEAS
    10. Kim, Eungab, 2004. "Stochastic vendor managed replenishment with demand dependent shipment," European Journal of Operational Research, Elsevier, vol. 152(3), pages 723-744, February.
    11. Guan, Hao & Wang, Hua & Meng, Qiang & Mak, Chin Long, 2023. "Markov chain-based traffic analysis on platooning effect among mixed semi- and fully-autonomous vehicles in a freeway lane," Transportation Research Part B: Methodological, Elsevier, vol. 173(C), pages 176-202.
    12. Antonio Gómez-Corral & Martín López-García & Maria Jesus Lopez-Herrero & Diana Taipe, 2020. "On First-Passage Times and Sojourn Times in Finite QBD Processes and Their Applications in Epidemics," Mathematics, MDPI, vol. 8(10), pages 1-25, October.
    13. Carri W. Chan & Mor Armony & Nicholas Bambos, 2016. "Maximum weight matching with hysteresis in overloaded queues with setups," Queueing Systems: Theory and Applications, Springer, vol. 82(3), pages 315-351, April.
    14. Berman, Oded & Wang, Jiamin & Sapna, K. P., 2005. "Optimal management of cross-trained workers in services with negligible switching costs," European Journal of Operational Research, Elsevier, vol. 167(2), pages 349-369, December.
    15. Nicky D. Van Foreest & Jacob Wijngaard, 2014. "On Optimal Policies for Production-Inventory Systems with Compound Poisson Demand and Setup Costs," Mathematics of Operations Research, INFORMS, vol. 39(2), pages 517-532, May.
    16. António Pacheco & Helena Ribeiro, 2008. "Consecutive customer losses in oscillating GI X /M//n systems with state dependent services rates," Annals of Operations Research, Springer, vol. 162(1), pages 143-158, September.
    17. J. R. Artalejo & A. Economou, 2005. "Markovian Controllable Queueing Systems with Hysteretic Policies: Busy Period and Waiting Time Analysis," Methodology and Computing in Applied Probability, Springer, vol. 7(3), pages 353-378, September.
    18. Hiroyuki Masuyama, 2019. "A sequential update algorithm for computing the stationary distribution vector in upper block-Hessenberg Markov chains," Queueing Systems: Theory and Applications, Springer, vol. 92(1), pages 173-200, June.
    19. Shin, Yang Woo, 2015. "Algorithmic approach to Markovian multi-server retrial queues with vacations," Applied Mathematics and Computation, Elsevier, vol. 250(C), pages 287-297.
    20. M. Yu. Kitaev & Richard F. Serfozo, 1999. "M/M/1 Queues with Switching Costs and Hysteretic Optimal Control," Operations Research, INFORMS, vol. 47(2), pages 310-312, April.
    21. Yang Woo Shin & Dug Hee Moon, 2014. "M/M/c Retrial Queue with Multiclass of Customers," Methodology and Computing in Applied Probability, Springer, vol. 16(4), pages 931-949, December.

    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:annopr:v:310:y:2022:i:2:d:10.1007_s10479-020-03903-2. 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.