Optimizing steady state Markov chains by state reduction

European Journal of Operational Research

Volumn 89, Issue 2, 1996, Pages 277-284

  Grassmann, Winfried K ^a  

^a UNIVERSITY OF SASKATCHEWAN   (Canada)

Author keywords

Markov processes; Optimization; Queueing; Service systems

Indexed keywords

GRAPH THEORY; OPTIMIZATION; PROBABILITY; QUEUEING THEORY; STATE SPACE METHODS;

NEWTON METHOD; SERVICE SYSTEMS; STATE REDUCTION;

MARKOV PROCESSES;

EID: 0030574819     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/0377-2217(95)00270-7     Document Type: Article

References (21)

1. Crabill, T.B., Gross, D., and Magazine, M.J. (1977), "A classified bibliography of research on optimal queues". Operations Research 25, 219-232.
2. Dewan, S., and Mendelson, H. (1990), "User delay costs and internal pricing for a service facility", Management Science 36, 1502-1517.
3. Grassmann, W.K. (1983), "The convexity of the mean queue size in the M/M/c queue with respect to the traffic intensity", Journal of Applied Probability 20, 916-919.
4. Grassmann, W.K. (1985), "The factorization of queueing equations and their interpretation", Journal of the Operational Research Society 36, 1041-1051.
5. Grassmann, W.K. (1993), "Rounding errors in certain algorithms involving Markov chains", ACM Transactions on Mathematical Software 19, 496-508.
6. Grassmann, W.K., and Chen, X. (1995), "The use of derivatives for optimizing steady state queues", Journal of the Operational Research Society 46, 104-115.
7. Grassmann, W.K., and Heyman, D.P. (1990), "Equilibrium distribution of block-structured Markov chains with repeating rows", Journal of Applied Probability 27, 557-576.
8. Grassmann, W.K., and Heyman, D.P. (1993), "Computation of steady-state probabilities for infinite-state Markov chains with repeating rows", ORSA Journal on Computing 5, 292-303.
9. Grassmann, W.K., Taksar, M.I., and Heyman, D.P. (1985), "Regenerative analysis and steady state distributions for Markov chains", Operations Research 33, 1107-1116.
10. Harel, A. (1990), "Convexity of the Erlang loss formula", Operations Research 19, 1193-1206",
11. Heyman, D.P. (1987), "Further comparisons of direct methods for computing stationary distributions of Markov chains", SIAM Journal for Algebraic and Discrete Methods 8, 226-232.
12. Heyman, D.P., and Reeves, A. (1989), "Numerical solutions arising in Markov chain models", ORSA Journal on Computing 1, 52-60.
13. Hillier, F.S. (1963), "Economic models for waiting time problems", Management Science 10, 119-130.
14. Kao, E.P.C. (1991), "Using state reduction for computing steady state probabilities of queues of G1/PH/1 types", ORSA Journal on Computing 3, 231-240.
15. Kao, E.P.C., and Lin, C. (1989a), "The M/M/1 queue with randomly varying arrival rates: A phase substitution approach", Management Science 35, 561-570.
16. Kao, E.P.C., and Lin, C. (1989b), "Computing the R matrices in matrix-geometric solutions for a class of QBD queues: A phase substitution approach", Stochastic Models 5, 629-643.
17. O'Cinneide, (1993), "Entrywise perturbation theory and error analysis for Markov chains", Numerische Mathematik 65, 109-120.
18. Stewart, G.W., and Zhang, G. (1991), "On a direct method for the solution of nearly uncoupled Markov chains", Numerische Mathematik 59, 1-11.
19. Strang, G. (1980), Linear Algebra and Its Applications, 2nd edn., Academic Press, New York.
20. van Ackere, A., and Ninios, P. (1993), "Simulation and queueing theory applied to a single server queue with advertising and balking", Journal of the Operational Research Society 44, 407-414.
21. van Ackere, A. (1995), "Capacity management: Pricing strategy, performance and the role of information", International Journal of Production Economics 40, 89-100.