IDEAS home Printed from https://ideas.repec.org/p/tiu/tiutis/54b74f52-9378-47b9-aa0f-5e283f22693c.html
   My bibliography  Save this paper

The Power-Series Algorithm for a Wide Class of Markov Processes

Author

Listed:
  • van den Hout, W.B.
  • Blanc, J.P.C.

    (Tilburg University, School of Economics and Management)

Abstract

No abstract is available for this item.

Suggested Citation

  • van den Hout, W.B. & Blanc, J.P.C., 1994. "The Power-Series Algorithm for a Wide Class of Markov Processes," Other publications TiSEM 54b74f52-9378-47b9-aa0f-5, Tilburg University, School of Economics and Management.
    • Handle: RePEc:tiu:tiutis:54b74f52-9378-47b9-aa0f-5e283f22693c
    as

    Download full text from publisher

    File URL: https://pure.uvt.nl/ws/portalfiles/portal/520018/87.pdf
    Download Restriction: no
    ---><---

    Other versions of this item:

    References listed on IDEAS

    as
    1. van den Hout, W.B. & Blanc, J.P.C., 1994. "The power-series algorithm for Markovian queueing networks," Discussion Paper 1994-67, Tilburg University, Center for Economic Research.
    2. Blanc, J.P.C., 1990. "Performance evaluation of polling systems by means of the power-series algorithm," Other publications TiSEM a5f5fb56-c17c-4c46-8d5e-b, Tilburg University, School of Economics and Management.
    3. Blanc, J.P.C. & van der Mei, R.D., 1993. "The power-series algorithm applied to polling systems with a dormant server," Other publications TiSEM ab862d96-146f-419e-a56e-2, Tilburg University, School of Economics and Management.
    4. J. P. C. Blanc, 1992. "The Power-Series Algorithm Applied to the Shortest-Queue Model," Operations Research, INFORMS, vol. 40(1), pages 157-167, February.
    5. van den Hout, W.B. & Blanc, J.P.C., 1993. "The Power-Series Algorithm Extended to the BMAP/PH/1 Queue," Papers 9360, Tilburg - Center for Economic Research.
    6. Blanc, J.P.C., 1993. "Performance Analysis and Optimization with the Power- Series Algorithm," Papers 9347, Tilburg - Center for Economic Research.
    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. van den Hout, W.B. & Blanc, J.P.C., 1994. "The power-series algorithm for Markovian queueing networks," Other publications TiSEM 1312893d-c375-4b17-bbbe-3, Tilburg University, School of Economics and Management.
    2. Blanc, J.P.C., 1998. "The power-series algorithm for polling systems with time limits," Other publications TiSEM 3366bad3-964d-4039-82cc-a, Tilburg University, School of Economics and Management.
    3. Blanc, J.P.C. & Lenzini, L., 1995. "Analysis of communication systems with timed token protocols using the power-series algorithm," Discussion Paper 1995-100, Tilburg University, Center for Economic Research.
    4. Blanc, J.P.C., 2009. "Bad luck when joining the shortest queue," European Journal of Operational Research, Elsevier, vol. 195(1), pages 167-173, May.
    5. Blanc, J.P.C., 1993. "Performance Analysis and Optimization with the Power-Series Algorithm," Other publications TiSEM a1a4fc9c-dcb5-4679-9ef1-e, Tilburg University, School of Economics and Management.
    6. Blanc, J.P.C., 1996. "Optimization of Periodic Polling Systems with Non-Preemptive, Time-Limited Service," Discussion Paper 1996-63, Tilburg University, Center for Economic Research.
    7. Kao, Edward P. C. & Wilson, Sandra D., 1999. "Analysis of nonpreemptive priority queues with multiple servers and two priority classes," European Journal of Operational Research, Elsevier, vol. 118(1), pages 181-193, October.
    8. Blanc, J.P.C., 1999. "On the Stability of Communication Systems with Timed Token Protocols," Other publications TiSEM bd28ec2d-1fc2-447d-9c0a-c, Tilburg University, School of Economics and Management.
    9. Partha Chakroborty & Rahul Gill & Pranamesh Chakraborty, 2016. "Analysing queueing at toll plazas using a coupled, multiple-queue, queueing system model: application to toll plaza design," Transportation Planning and Technology, Taylor & Francis Journals, vol. 39(7), pages 675-692, October.
    10. Valeriy Naumov, 2024. "A Matrix-Multiplicative Solution for Multi-Dimensional QBD Processes," Mathematics, MDPI, vol. 12(3), pages 1-15, January.
    11. Blanc, J.P.C. & van der Mei, R.D., 1992. "Optimization of polling systems with Bernoulli schedules," Research Memorandum FEW 563, Tilburg University, School of Economics and Management.
    12. Plinio S. Dester & Christine Fricker & Danielle Tibi, 2017. "Stationary analysis of the shortest queue problem," Queueing Systems: Theory and Applications, Springer, vol. 87(3), pages 211-243, December.
    13. Blanc, J.P.C., 1990. "Performance evaluation of polling systems by means of the power-series algorithm," Research Memorandum FEW 459, Tilburg University, School of Economics and Management.
    14. Herwig Bruneel & Arnaud Devos, 2024. "Explicit Solutions for Coupled Parallel Queues," Mathematics, MDPI, vol. 12(15), pages 1-31, July.
    15. M. Saxena & I. Dimitriou & S. Kapodistria, 2020. "Analysis of the shortest relay queue policy in a cooperative random access network with collisions," Queueing Systems: Theory and Applications, Springer, vol. 94(1), pages 39-75, February.
    16. Koole, Ger & Pot, Auke, 2006. "Workload minimization in re-entrant lines," European Journal of Operational Research, Elsevier, vol. 174(1), pages 216-233, October.
    17. Dieter Fiems & Tuan Phung-Duc, 2019. "Light-traffic analysis of random access systems without collisions," Annals of Operations Research, Springer, vol. 277(2), pages 311-327, June.
    18. Arnaud Devos & Joris Walraevens & Dieter Fiems & Herwig Bruneel, 2022. "Approximations for the performance evaluation of a discrete-time two-class queue with an alternating service discipline," Annals of Operations Research, Springer, vol. 310(2), pages 477-503, March.
    19. Ahmad Hanbali & Roland Haan & Richard Boucherie & Jan-Kees Ommeren, 2012. "Time-limited polling systems with batch arrivals and phase-type service times," Annals of Operations Research, Springer, vol. 198(1), pages 57-82, September.
    20. Dieter Fiems & Balakrishna Prabhu & Koen Turck, 2013. "Analytic approximations of queues with lightly- and heavily-correlated autoregressive service times," Annals of Operations Research, Springer, vol. 202(1), pages 103-119, January.

    More about this item

    Statistics

    Access and download statistics

    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:tiu:tiutis:54b74f52-9378-47b9-aa0f-5e283f22693c. 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: Richard Broekman (email available below). General contact details of provider: https://www.tilburguniversity.edu/about/schools/economics-and-management/ .

    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.