Skip to main content
Log in

Two classes of time-inhomogeneous Markov chains: Analysis of the periodic case

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

We consider the M/G/1 and GI/M/1 types of Markov chains for which their one step transitions depend on the times of the transitions. These types of Markov chains are encountered in several stochastic models, including queueing systems, dams, inventory systems, insurance risk models, etc. We show that for the cases when the time parameters are periodic the systems can be analyzed using some extensions of known results in the matrix-analytic methods literature. We have limited our examples to those relating to queueing systems to allow us a focus. An example application of the model to a real life problem is presented.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • Alfa, A. S. (1982). Time-inhomogeneous bulk server queue in discrete time: A transportation type problem. Operations Research, 30, 650–658.

    Article  Google Scholar 

  • Bini, D., & Meini, B. (1995). On cyclic reduction applied to a class of Toeplitz-like matrices arising in queueing problems. In W. J. Stewart (Ed.), Computations with Markov chains (pp. 21–38). Amsterdam: Kluwer Academic.

    Google Scholar 

  • Breuer, L. (2001). The periodic BMAP/PH/c queue. Queueing Systems, 38, 67–76.

    Article  Google Scholar 

  • Gail, H. R., Hantler, S. L., & Taylor, B. A. (1997). Non-skip-free M/G/1 and GI/M/1 types Markov chains. Advances in Applied Probability, 29(3), 733–758.

    Article  Google Scholar 

  • Hall, R. W. (1991). Queueing methods for services and manufacturing. Englewood Cliffs: Prentice Hall.

    Google Scholar 

  • Ingolfsson, A. (2005). Modeling the M(t)/M/s(t) queue with an exhaustive discipline (Working paper). Available online at http://www.business.ualberta.ca/aingolfsson/documents/PDF/MMs_note.pdf.

  • Margolius, B. (2005). Transient solution to the time-dependent multi-server Poisson queue. Journal of Applied Probability, 42, 766–777.

    Article  Google Scholar 

  • Massey, W. A., & Whitt, W. (1998). Uniform acceleration expansions for Markov chains with time-varying rates. Annals of Applied Probability, 8(4), 1130–1155.

    Article  Google Scholar 

  • Neuts, M. F. (1981). Matrix-geometric solutions in stochastic models: An algorithmic approach. Baltimore: Hopkins University Press.

    Google Scholar 

  • Neuts, M. F. (1989). Structured stochastic matrices of the M/G/1 type and their applications. New York: Marcel Dekker.

    Google Scholar 

  • Ramaswami, V. (1988). Stable recursion for the steady state vector for Markov chains of M/G/1 type. Communications in Statistics-Stochastic Models, 4, 183–188.

    Article  Google Scholar 

  • Yin, G., & Zhang, H. (2005). Two-time-scale Markov chains and applications to quasi-birth-death queues. SIAM Journal on Applied Mathematics, 65(2), 567–568.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Attahiru Sule Alfa.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Alfa, A.S., Margolius, B.H. Two classes of time-inhomogeneous Markov chains: Analysis of the periodic case. Ann Oper Res 160, 121–137 (2008). https://doi.org/10.1007/s10479-007-0300-3

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-007-0300-3

Keywords

Navigation