Optimizing steady state Markov chains by state reduction
From MaRDI portal
Publication:1266688
DOI10.1016/0377-2217(95)00270-7zbMath0913.90105OpenAlexW2005568060MaRDI QIDQ1266688
Publication date: 7 October 1998
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(95)00270-7
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Related Items
Cites Work
- Unnamed Item
- On a direct method for the solution of nearly uncoupled Markov chains
- Entrywise perturbation theory and error analysis for Markov chains
- Further Comparisons of Direct Methods for Computing Stationary Distributions of Markov Chains
- The convexity of the mean queue size of the M/M/c queue with respect to the traffic intensity
- Equilibrium distribution of block-structured Markov chains with repeating rows
- The Factorization of Queueing Equations and Their Interpretation
- Regenerative Analysis and Steady State Distributions for Markov Chains
- The M/M/1 Queue with Randomly Varying Arrival and Service Rates: A Phase Substitution Solution
- Computing the r matrices in matrix-geometric solutions for a class of qbd queues: a phase substitution approach
- Using State Reduction for Computing Steady State Probabilities of Queues of GI/PH/1 Types
- Numerical Solution of Linear Equations Arising in Markov Chain Models
- A Classified Bibliography of Research on Optimal Design and Control of Queues
- Computation of Steady-State Probabilities for Infinite-State Markov Chains with Repeating Rows
- Rounding errors in certain algorithms involving Markov chains
- The Use of Derivatives for Optimizing Steady State Queues
- Simulation and Queueing Theory Applied to a Single-server Queue with Advertising and Balking
- User Delay Costs and Internal Pricing for a Service Facility
