Dynamic scheduling in multiclass queueing networks: Stability under discrete-review policies
From MaRDI portal
Publication:1306521
DOI10.1023/A:1019106213778zbMath0934.90021MaRDI QIDQ1306521
Publication date: 4 October 1999
Published in: Queueing Systems (Search for Journal in Brave)
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Related Items (10)
Discrete-review policies for scheduling stochastic networks: trajectory tracking and fluid-scale asymptotic optimality. ⋮ Near optimal control of queueing networks over a finite time horizon ⋮ On the modelling and performance measurement of service networks with heterogeneous customers ⋮ Large-deviations analysis of the fluid approximation for a controllable tandem queue ⋮ An Overview for Markov Decision Processes in Queues and Networks ⋮ Heavy traffic analysis of open processing networks with complete resource pooling: asymptotic optimality of discrete review policies ⋮ Pathwise stability of multiclass queueing networks ⋮ An exact solution for the state probabilities of the multi-class, multi-server queue with preemptive priorities ⋮ Dynamic safety-stocks for asymptotic optimality in stochastic networks ⋮ Minimal and Locally Edge Minimal Fluid Models for Resource-Sharing Networks
This page was built for publication: Dynamic scheduling in multiclass queueing networks: Stability under discrete-review policies
