Optimal control of a multiclass queueing system when customers can change types
DOI10.1007/s11134-015-9466-6zbMath1341.60110OpenAlexW2177290437MaRDI QIDQ285963
Publication date: 19 May 2016
Published in: Queueing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11134-015-9466-6
optimal controlMarkov decision processcustomer typesmulticlass queueing systemsmoothed rate truncation methodunbounded transition rates
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Optimal stochastic control (93E20) Markov and semi-Markov decision processes (90C40) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Existence of optimal solutions to problems involving randomness (49J55)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Convergence of controlled models and finite-state approximation for discounted continuous-time Markov decision processes with constraints
- On structural properties of the value function for an unbounded jump Markov process with an application to a processor sharing retrial queue
- Dynamic control of a single-server system with abandonments
- Applied stochastic control of jump diffusions.
- Non-ergodicity criteria for denumerable continuous time Markov processes.
- Stochastic orders
- On the stationary distribution of queue lengths in a multi-class priority queueing system with customer transfers
- Continuous-time Markov decision processes. Theory and applications
- Point processes and queues. Martingale dynamics
- A survey of Markov decision models for control of networks of queues
- Dynamic scheduling with convex delay costs: The generalized \(c\mu\) rule
- The transformation method for continuous-time Markov decision processes
- Stability of a priority queueing system with customer transfers
- Heavy-Traffic Limits for a Many-Server Queueing Network with Switchover
- Technical Note—An Equivalence Between Continuous and Discrete Time Markov Decision Processes
- New discount and average optimality conditions for continuous-time Markov decision processes
- On the Accuracy of Fluid Models for Capacity Sizing in Queueing Systems with Impatient Customers
- Priority queue with customer upgrades
- A Broader View of Designing the Liver Allocation System
- Discounted Continuous-Time Markov Decision Processes with Constraints: Unbounded Transition and Loss Rates
- Scheduling tasks with exponential service times on parallel processors
- The cμ rule revisited
- Scheduling stochastic jobs on a single machine subject to breakdowns
- THE N-NETWORK MODEL WITH UPGRADES
- Scheduling jobs with stochastically ordered processing times on parallel machines to minimize expected flowtime
- Average Cost Optimal Stationary Policies in Infinite State Markov Decision Processes with Unbounded Costs
- Scheduling jobs by stochastic processing requirements on parallel machines to minimize makespan or flowtime
- Discounted Continuous-Time Controlled Markov Chains: Convergence of Control Models
- Approximating Ergodic Average Reward Continuous-Time Controlled Markov Chains
- Average optimality for continuous-time Markov decision processes under weak continuity conditions
- Constrained Optimization for Average Cost Continuous-Time Markov Decision Processes
- Monotonicity in Markov Reward and Decision Chains: Theory and Applications
This page was built for publication: Optimal control of a multiclass queueing system when customers can change types
