Scheduling control for Markov-modulated single-server multiclass queueing systems in heavy traffic
From MaRDI portal
diffusion approximiationsheavy trafficMarkov-modulated queueing networksmultiscale queueing systemsscheduling control
Central limit and other weak theorems (60F05) Functional limit theorems; invariance principles (60F17) Applications of Brownian motions and diffusion theory (population genetics, absorption problems, etc.) (60J70) Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Stochastic scheduling theory in operations research (90B36)
Abstract: This paper studies a scheduling control problem for a single-server multiclass queueing network in heavy traffic, operating in a changing environment. The changing environment is modeled as a finite state Markov process that modulates the arrival and service rates in the system. Various cases are considered: fast changing environment, fixed environment and slow changing environment. In each of the cases, using weak convergence analysis, in particular functional limit theorems for renewal processes and ergodic Markov processes, it is shown that an appropriate "averaged" version of the classical cmu -policy (the priority policy that favors classes with higher values of the product of holding cost c and service rate mu) is asymptotically optimal for an infinite horizon discounted cost criterion.
Recommendations
- Optimal control of Markov-modulated multiclass many-server queues
- Scheduling control for queueing systems with many servers: asymptotic optimality in heavy traffic
- Scheduling a multi class queue with many exponential servers: asymptotic optimality in heavy traffic.
- Scheduling Networks of Queues: Heavy Traffic Analysis of a Two-Station Closed Network
- Optimal scheduling of critically loaded multiclass \(GI/m/n+m\) queues in an alternating renewal environment
Cites work
- A Liapounov bound for solutions of the Poisson equation
- Control of mobile communications with time-varying channels in heavy traffic
- Dynamic scheduling of a system with two parallel servers in heavy traffic with resource pooling: Asymptotic optimality of a threshold policy
- Dynamic scheduling with convex delay costs: The generalized \(c\mu\) rule
- Heavy traffic approximations of a queue with varying service rates and general arrivals
- scientific article; zbMATH DE number 1631026 (Why is no real title available?)
- scientific article; zbMATH DE number 3951715 (Why is no real title available?)
- scientific article; zbMATH DE number 1354815 (Why is no real title available?)
- scientific article; zbMATH DE number 1834045 (Why is no real title available?)
- scientific article; zbMATH DE number 3342557 (Why is no real title available?)
- Markov-modulated queueing systems
- Markovian queueing networks in a random environment
- Scheduling Flexible Servers with Convex Delay Costs: Heavy-Traffic Optimality of the Generalized cμ-Rule
- Stochastic-Process Limits
- The M/G/1 queue with two service speeds
- The Queue M|G|1 with Markov Modulated Arrivals and Services
Cited in
(7)- On the Whittle index of Markov modulated restless bandits
- Optimal scheduling of critically loaded multiclass \(GI/m/n+m\) queues in an alternating renewal environment
- Markov-modulated \(\mathrm{M}/\mathrm{G}/1\)-type queue in heavy traffic and its application to time-sharing disciplines
- Dynamic service rate control for a single-server queue with Markov-modulated arrivals
- Optimal control of Markov-modulated multiclass many-server queues
- Dynamic scheduling with uncertain job types
- Ergodic control of multi-class \(\mathrm{M}/\mathrm{M}/N+\mathrm{M}\) queues in the Halfin-Whitt regime
This page was built for publication: Scheduling control for Markov-modulated single-server multiclass queueing systems in heavy traffic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q475127)
