Dynamic scheduling of a system with two parallel servers in heavy traffic with resource pooling: Asymptotic optimality of a threshold policy
type: Item
instance of: scholarly article
title: Dynamic scheduling of a system with two parallel servers in heavy traffic with resource pooling: Asymptotic optimality of a threshold policy
zbMATH Open document ID: 1015.60080
author: S. L. Bell
author: R. J. Williams
published in: The Annals of Applied Probability
publication date: 2003-05-06T00:00:00Z
review text: The authors consider a queueing system consisting of two buffers and two parallel servers with dynamic scheduling capabilities. One server can process jobs from one buffer, whereas the other server can process jobs from either buffer. The service time distribution may depend on the buffer being served and the server providing service. The system manager dynamically schedules waiting jobs onto available servers. The authors consider a parameter regime in which the system satisfies both a heavy traffic condition and a resource pooling condition. The cost function is a mean cumulative discounted cost of holding jobs in the system. They propose a dynamic threshold control policy and show that it is the same as the optimal cost for the Brownian control problem.
reviewed by: P. R. Parthasarathy
Mathematics Subject Classification ID: 60K25
Mathematics Subject Classification ID: 90B36
Mathematics Subject Classification ID: 68M20
zbMATH DE Number: 1906217
zbMATH Keywords: queueing networks
zbMATH Keywords: diffusion approximations
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1214/aoap/1015345343
OpenAlex ID: W1974518363
cites work: Q5560061
cites work: Convergence to equilibria for fluid models of FIFO queueing networks
cites work: Q3354428
cites work: Scheduling Networks of Queues: Heavy Traffic Analysis of a Multistation Closed Network
cites work: Q4391441
cites work: Q3721531
cites work: Q3808989
cites work: Q3806523
cites work: Q4894801
cites work: Heavy traffic analysis of a system with parallel servers: Asymptotic optimality of discrete-review policies
cites work: Brownian models of open processing networks: Canonical representation of workload.
cites work: Heavy traffic resource pooling in parallel-server systems
cites work: Dynamic control of Brownian networks: State space collapse and equivalent workload formulations
cites work: Scheduling networks of queues: Heavy traffic analysis of a simple open network
cites work: Scheduling Networks of Queues: Heavy Traffic Analysis of a Two-Station Closed Network
cites work: The Equivalence of Functional Central Limit Theorems for Counting Processes and Associated Partial Sums
cites work: Principles on the Benefits of Manufacturing Process Flexibility
cites work: Dynamic routing in open queueing networks: Brownian models, cut constraints and resource pooling
cites work: Two-server closed networks in heavy traffic: diffusion limits and asymptotic optimality.
cites work: Optimal control of assignment of jobs to processors under heavy traffic
cites work: Q4004190
cites work: Routing and Singular Control for Queueing Networks in Heavy Traffic
cites work: Heavy Traffic Analysis of a Controlled Multiclass Queueing Network via Weak Convergence Methods
cites work: Resource pooling in queueing networks with dynamic routing
cites work: Dynamic Scheduling of a Four-Station Queueing Network
cites work: Heavy Traffic Convergence of a Controlled, Multiclass Queueing System
cites work: Probabilistic Modelling
cites work: A Heavy Traffic Limit Theorem for Networks of Queues with Multiple Customer Types
cites work: A critically loaded multirate link with trunk reservation
cites work: Convex Analysis
cites work: Dynamic scheduling with convex delay costs: The generalized \(c\mu\) rule
cites work: Scheduling Networks of Queues: Heavy Traffic Analysis of a Two-Station Network with Controllable Inputs
cites work: An invariance principle for semimartingale reflecting Brownian motions in an orthant
cites work: Diffusion approximations for open multiclass queueing networks: Sufficient conditions involving state space collapse
cites work: On dynamic scheduling of a parallel server system with complete resource pooling
DOI: 10.1214/AOAP/1015345343
description: scientific article; zbMATH DE number 1906217