DES AND RES PROCESSES AND THEIR EXPLICIT SOLUTIONS

DOI10.1017/S0269964814000291zbMath1370.60172OpenAlexW2330717020MaRDI QIDQ5358035

Michael N. Katehakis, Laurens C. Smit, Floske M. Spieksma

Publication date: 19 September 2017

Published in: Probability in the Engineering and Informational Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0269964814000291

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)

Related Items

Stationary analysis of the shortest queue problem, LINEAR BIRTH/IMMIGRATION-DEATH PROCESS WITH BINOMIAL CATASTROPHES, Retrial queueing system with balking, optional service and vacation, Waiting-time analysis of D-BMAP/G/1 queueing system, A comparative analysis of the successive lumping and the lattice path counting algorithms, Level product form QSF processes and an analysis of queues with <scp>C</scp> oxian interarrival distribution, Service with a queue and a random capacity cart: random processing batches and E-limited policies, The impact of disruption characteristics on the performance of a server, A successive censoring algorithm for a system of connected LDQBD-processes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The \(M/M/1\) queue with synchronized abandonments
• A note on the hypercube model
• The maximum number of infected individuals in SIS epidemic models: computational techniques and quasi-stationary distributions
• Non-negative matrices and Markov chains. 2nd ed
• Computing the stationary distribution for infinite Markov chains
• On recurring theorems on diagonal dominance
• AIMD algorithms and exponential functionals
• Sojourn time asymptotics in the \(M/G/1\) processor sharing queue
• Jointly optimal allocation of a repairman and optimal control of service rate for machine repairman problem
• Erlang arrivals joining the shorter queue
• Ergodic properties of nonnegative matrices. I
• Triangular M/G/1-Type and Tree-Like Quasi-Birth-Death Markov Chains
• SOME RESULTS FOR SKIP-FREE RANDOM WALK
• Optimal stopping of Markov chains and three abstract optimization problems
• Modeling and analysis of uncertain time-critical tasking problems
• Retrial Queueing Systems
• Scheduling policies for an antiterrorist surveillance system
• Optimal Repair Allocation in a Series System
• The Multi-Armed Bandit Problem: Decomposition and Computation
• A stable recursion for the steady state vector in markov chains of m/g/1 type
• Stability Conditions for Multidimensional Queueing Systems with Computer Applications
• On the optimal assignment of servers and a repairman
• Criteria for ergodicity, exponential ergodicity and strong ergodicity of Markov processes
• Scheduling jobs by stochastic processing requirements on parallel machines to minimize makespan or flowtime
• On ergodicity and recurrence properties of a Markov chain by an application to an open jackson network
• Introduction to Matrix Analytic Methods in Stochastic Modeling
• A logarithmic reduction algorithm for quasi-birth-death processes
• Strengthening ergodicity to geometric ergodicity for markov chains
• On the Solution of a Nonlinear Matrix Equation Arising in Queueing Problems
• On the convergence of the power series algorithm
• On the optimal maintenance of systems and control of arrivals in queues
• Calculating the equilibrium distribution in level dependent quasi-birth-and-death processes
• Optimal policies for scheduling repairs and allocating heterogeneous servers
• A SUCCESSIVE LUMPING PROCEDURE FOR A CLASS OF MARKOV CHAINS
• Numerical Methods for Structured Markov Chains
• The Optimal Inventory Policy for Batch Ordering
• The calculation of limit probabilities for denumerable Markov processes from infinitesimal properties
• ON DEVIATION MATRICES FOR BIRTH–DEATH PROCESSES