DES AND RES PROCESSES AND THEIR EXPLICIT SOLUTIONS (Q5358035)

From MaRDI portal

Revision as of 11:28, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article; zbMATH DE number 6776116

Language	Label	Description	Also known as
English	DES AND RES PROCESSES AND THEIR EXPLICIT SOLUTIONS	scientific article; zbMATH DE number 6776116

Statements

scholarly article

0 references

DES AND RES PROCESSES AND THEIR EXPLICIT SOLUTIONS (English)

0 references

zbMATH Open document ID

0 references

10.1017/S0269964814000291

0 references

Michael N. Katehakis

0 references

Laurens C. Smit

0 references

Floske M. Spieksma

0 references

Probability in the Engineering and Informational Sciences

0 references

publication date

19 September 2017

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

MaRDI profile type

MaRDI publication profile

0 references

Erlang arrivals joining the shorter queue

0 references

The maximum number of infected individuals in SIS epidemic models: computational techniques and quasi-stationary distributions

0 references

Retrial Queueing Systems

0 references

Numerical Methods for Structured Markov Chains

0 references

On the Solution of a Nonlinear Matrix Equation Arising in Queueing Problems

0 references

Calculating the equilibrium distribution in level dependent quasi-birth-and-death processes

0 references

SOME RESULTS FOR SKIP-FREE RANDOM WALK

0 references

On the optimal assignment of servers and a repairman

0 references

Jointly optimal allocation of a repairman and optimal control of service rate for machine repairman problem

0 references

Modeling and analysis of uncertain time-critical tasking problems

0 references

AIMD algorithms and exponential functionals

0 references

On the convergence of the power series algorithm

0 references

On ergodicity and recurrence properties of a Markov chain by an application to an open jackson network

0 references

Triangular M/G/1-Type and Tree-Like Quasi-Birth-Death Markov Chains

0 references

The \(M/M/1\) queue with synchronized abandonments

0 references

A note on the hypercube model

0 references

Optimal Repair Allocation in a Series System

0 references

On the optimal maintenance of systems and control of arrivals in queues

0 references

A SUCCESSIVE LUMPING PROCEDURE FOR A CLASS OF MARKOV CHAINS

0 references

The Multi-Armed Bandit Problem: Decomposition and Computation

0 references

ON DEVIATION MATRICES FOR BIRTH–DEATH PROCESSES

0 references

A logarithmic reduction algorithm for quasi-birth-death processes

0 references

Introduction to Matrix Analytic Methods in Stochastic Modeling

0 references

Scheduling policies for an antiterrorist surveillance system

0 references

0 references

0 references

A stable recursion for the steady state vector in markov chains of m/g/1 type

0 references

Optimal policies for scheduling repairs and allocating heterogeneous servers

0 references

0 references

0 references

Computing the stationary distribution for infinite Markov chains

0 references

Non-negative matrices and Markov chains. 2nd ed

0 references

Optimal stopping of Markov chains and three abstract optimization problems

0 references

Strengthening ergodicity to geometric ergodicity for markov chains

0 references

Stability Conditions for Multidimensional Queueing Systems with Computer Applications

0 references

The calculation of limit probabilities for denumerable Markov processes from infinitesimal properties

0 references

Criteria for ergodicity, exponential ergodicity and strong ergodicity of Markov processes

0 references

0 references

On recurring theorems on diagonal dominance

0 references

The Optimal Inventory Policy for Batch Ordering

0 references

Ergodic properties of nonnegative matrices. I

0 references

Scheduling jobs by stochastic processing requirements on parallel machines to minimize makespan or flowtime

0 references

Sojourn time asymptotics in the \(M/G/1\) processor sharing queue

0 references

full work available at URL

https://doi.org/10.1017/s0269964814000291

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5358035

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5358035&oldid=37286037"