Average Cost Semi-Markov Decision Processes and the Control of Queueing Systems
From MaRDI portal
Publication:3415928
DOI10.1017/S0269964800001121zbMath1134.60408MaRDI QIDQ3415928
Publication date: 19 January 2007
Published in: Probability in the Engineering and Informational Sciences (Search for Journal in Brave)
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Statistical decision theory (62C99)
Related Items
Time and Ratio Expected Average Cost Optimality for Semi-Markov Control Processes on Borel Spaces ⋮ On undiscounted semi-Markov decision processes with absorbing states ⋮ The existence of sensitive optimal policies in two multi-dimensional queueing models ⋮ Optimality in Feller semi-Markov control processes ⋮ Computing semi-stationary optimal policies for multichain semi-Markov decision processes ⋮ Quantile Markov Decision Processes ⋮ New average optimality conditions for semi-Markov decision processes in Borel spaces ⋮ Optimal control of a simple immigration--emigration process through total catastrophes. ⋮ Simultaneous determination of production and maintenance schedules using in‐line equipment condition and yield information ⋮ Recent results on conditions for the existence of average optimal stationary policies ⋮ Denumerable semi-Markov decision chains with small interest rates ⋮ An Overview for Markov Decision Processes in Queues and Networks ⋮ A note on the vanishing interest rate approach in average Markov decision chains with continuous and bounded costs ⋮ On strong average optimality of Markov decision processes with unbounded costs ⋮ Comparing recent assumptions for the existence of average optimal stationary policies ⋮ Admission control of a service station when the arrivals are internal ⋮ Computation of the optimal policy for the control of a compound immigration process through total catastrophes ⋮ Convex stochastic fluid programs with average cost. ⋮ A Fixed Point Approach to Solve the Average Cost Optimality Equation for Semi-Markov Decision Processes with Feller Transition Probabilities ⋮ Computation of a near-optimal service policy for a single-server queue with homogeneous jobs ⋮ A survey of Markov decision models for control of networks of queues ⋮ Zero-sum ergodic semi-Markov games with weakly continuous transition probabilities ⋮ SINGLE-MACHINE MULTIPLE-RECIPE PREDICTIVE MAINTENANCE ⋮ Optimal dynamic assignment of a flexible worker on an open production line with specialists ⋮ Value iteration in countable state average cost Markov decision processes with unbounded costs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new condition for the existence of optimal stationary policies in average cost Markov decision processes
- Denumerable state semi-Markov decision processes with unbounded costs, average cost criterion
- Denumerable Undiscounted Semi-Markov Decision Processes with Unbounded Rewards
- On monotone optimal policies in a queueing model ofM/G/1 type with controllable service time distribution
- On Dynamic Programming with Unbounded Rewards
- Optimal control of batch service queues with switching costs
- Time-Sharing Service Systems. I
- Optimal control of service rates in networks of queues
- Optimal service-rate selection in an $M| G |\hat 1$Queue
- Optimal control of batch service queues
- What is the Laplace Transform?
