The Use of Eigenvalues for Finding Equilibrium Probabilities of Certain Markovian Two-Dimensional Queueing Problems

References

  • Adan I. J. B. F., Resing J. A. C., Plateau B., Stewart W. J., Silva M. A class of Markov processes on a semi-infinite strip. 3rd International Meeting on the Numerical Solution of Markov Chains (1999) 41–57Google Scholar
  • Bertsimas D. An analytic approach to a general class of G/G/s queueing systems. Oper. Res. (1990) 38:139–155LinkGoogle Scholar
  • Daigle J. N., Lucantoni D. M., Stewart W. J. Queueing systems having phase-dependent arrival and service rates. First International Conference on the Numerical Solution of Markov Chains (1991) (Marcel Dekker, New York) 179–215Google Scholar
  • Drekic S., Grassmann W. K. An eigenvalue approach to analyzing a finite source priority queueing model. Ann. Oper. Res. (2002) 112:139–152CrossrefGoogle Scholar
  • Gail H. R., Hantler S. L., Taylor B. A., Grassmann W. K. Use of characteristic roots for solving infinite state Markov chains. Computational Probability (2000) (Kluwer Academic Publishers, Boston, MA) 205–254International Series in Operations Research and Management Science, chapter 7CrossrefGoogle Scholar
  • Gohberg I., Lancaster P., Rodman L.Matrix Polynomials (1982) (Academic Press, New York) Google Scholar
  • Grassmann W. K. Real eigenvalues of certain tridiagonal matrix polynomials, with queueing applications. J. Linear Algebra and Its Appl. (2002) 342:93–106CrossrefGoogle Scholar
  • Grassmann W. K., Drekic S. An analytical solution for a tandem queue with blocking. Queueing Systems (2000) 36:221–235CrossrefGoogle Scholar
  • Green L. A queueing system with general-use and limited-use servers. Oper. Res. (1985) 33:168–182LinkGoogle Scholar
  • Haverkort B. R., Ost A. Steady-state analysis of infinite stochastic Petri nets: a comparison between the spectral expansion and the matrix-geometric method. Proc. 7th Internat. Workshop on Petri Nets and Performance Models (1997) Saint Malo, France(IEEE Computer Society Press)36–45CrossrefGoogle Scholar
  • Karlin S., McGregor J. Ehrenfest urn models. J. Appl. Probab. (1965) 2:352–376CrossrefGoogle Scholar
  • Kemeni J. G., Snell J. L., Knapp A. W.Denumerable Markov Chains (1966) (Van Nostrand, Princeton, NJ) Google Scholar
  • Konheim A. G., Reiser M. A queueing model with finite waiting room and blocking. J. ACM (1976) 23:328–341CrossrefGoogle Scholar
  • Konheim A. G., Reiser M. Finite capacity queueing systems with applications in computer modeling. SIAM J. Comput. (1978) 7:210–229CrossrefGoogle Scholar
  • Ledermann W., Reuter G. E. Spectral theory for the differential equations of simple birth and death processes. Philos. Trans. Roy. Soc. London, Ser. A (1954) 246:321–369CrossrefGoogle Scholar
  • Mitrani I., Chakka R. Spectral expansion solution for a class of Markov models: Application and comparison with the matrix-geometric method. Performance Evaluation (1995) 23:241–260CrossrefGoogle Scholar
  • Mitrany I., Avi-Itzhak B. A many-server queue with service interruption. Oper. Res. (1968) 16:628–638LinkGoogle Scholar
  • Neuts M. F.Matrix-Geometric Solutions in Stochastic Models (1981) (Johns Hopkins University Press, Baltimore, MD) Google Scholar
  • Perlis S.Theory of Matrices (1952) (Addison-Wesley, Cambridge, MA) Google Scholar
  • Press W. H., Flannery B. P., Teukolsky S. A., Vetterling W. T.Numerical Recipes (1986) (Cambridge University Press, Cambridge, UK) Google Scholar
  • Stanford D. A., Grassmann W. K. The bilingual server system: A queueing model featuring fully and partially qualified servers. INFOR (1993) 31:261–277Google Scholar
  • Stanford D. A., Grassmann W. K., McDonald D. R., Turner S. R E. Bilingual server call centres. Fields Institute Communications (2000) 28(American Mathematical Society, Providence, RI) 31–47Google Scholar
  • Turnbull H. W.Theory of Equations (1952) 5th ed.(Oliver and Boyd, Edinburgh, Scotland) Google Scholar
  • Wilkinson J. S.The Algebraic Eigenvalue Problem (1965) (Clarendon Press, Oxford, UK) Google Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.