Optimal control of a multiclass queueing system when customers can change types
From MaRDI portal
(Redirected from Publication:285963)
Markov decision processoptimal controlcustomer typesmulticlass queueing systemsmoothed rate truncation methodunbounded transition rates
Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Existence of optimal solutions to problems involving randomness (49J55) Markov and semi-Markov decision processes (90C40) Optimal stochastic control (93E20)
Recommendations
- Dynamic control of a single-server system when jobs change status
- Optimal intensity control of a multi-class queue
- Optimal control of a queueing network system with two types of customers
- On the asymptotic optimality of the \(c \mu / \theta \) rule under ergodic cost
- Dynamic scheduling of multiclass many-server queues with abandonment: the generalized \(c \mu / h\) rule
Cites work
- scientific article; zbMATH DE number 3858807 (Why is no real title available?)
- scientific article; zbMATH DE number 3736680 (Why is no real title available?)
- scientific article; zbMATH DE number 1233798 (Why is no real title available?)
- scientific article; zbMATH DE number 700091 (Why is no real title available?)
- scientific article; zbMATH DE number 1093829 (Why is no real title available?)
- A Broader View of Designing the Liver Allocation System
- A survey of Markov decision models for control of networks of queues
- Applied stochastic control of jump diffusions.
- Approximating Ergodic Average Reward Continuous-Time Controlled Markov Chains
- Average Cost Optimal Stationary Policies in Infinite State Markov Decision Processes with Unbounded Costs
- Average optimality for continuous-time Markov decision processes under weak continuity conditions
- Comparison methods for stochastic models and risks
- Constrained Optimization for Average Cost Continuous-Time Markov Decision Processes
- Continuous-time Markov decision processes. Theory and applications
- Convergence of controlled models and finite-state approximation for discounted continuous-time Markov decision processes with constraints
- Discounted Continuous-Time Markov Decision Processes with Constraints: Unbounded Transition and Loss Rates
- Discounted continuous-time controlled Markov chains: convergence of control models
- Dynamic control of a single-server system with abandonments
- Dynamic programming and optimal control. Vol. 2.
- Dynamic scheduling with convex delay costs: The generalized \(c\mu\) rule
- Heavy-traffic limits for a many-server queueing network with switchover
- Monotonicity in Markov Reward and Decision Chains: Theory and Applications
- New discount and average optimality conditions for continuous-time Markov decision processes
- Non-ergodicity criteria for denumerable continuous time Markov processes.
- On structural properties of the value function for an unbounded jump Markov process with an application to a processor sharing retrial queue
- On the accuracy of fluid models for capacity sizing in queueing systems with impatient customers
- On the stationary distribution of queue lengths in a multi-class priority queueing system with customer transfers
- Point processes and queues. Martingale dynamics
- Priority queue with customer upgrades
- Scheduling jobs by stochastic processing requirements on parallel machines to minimize makespan or flowtime
- Scheduling jobs with stochastically ordered processing times on parallel machines to minimize expected flowtime
- Scheduling stochastic jobs on a single machine subject to breakdowns
- Scheduling tasks with exponential service times on parallel processors
- Stability of a priority queueing system with customer transfers
- Stochastic orders
- Technical Note—An Equivalence Between Continuous and Discrete Time Markov Decision Processes
- The cμ rule revisited
- The \(N\)-network model with upgrades
- The transformation method for continuous-time Markov decision processes
Cited in
(7)- Optimal insertion of customers with waiting time targets
- A customer service model in an adaptive-modulation mobile communication cell with allowance for random environment
- The disadvantage of the Cμ‐rule when customers are strategic
- Dynamic control of a single-server system when jobs change status
- Optimal control of a queueing network system with two types of customers
- An overview for Markov decision processes in queues and networks
- A queueing system with a batch Markovian arrival process and varying priorities
This page was built for publication: Optimal control of a multiclass queueing system when customers can change types
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q285963)
