Using aggregation to construct periodic policies for routing jobs to parallel servers with deterministic service times

Authors:
Jeffrey W. Herrmann
Affiliations:
A. James Clark School of Engineering, University of Maryland, College Park, USA 20742
Venue:
Journal of Scheduling
Year:
2012

Citing 9
Cited 0

Optimization of static traffic allocation policies

Theoretical Computer Science - Special issue on probabilistic modelling
Balanced sequences and optimal routing

Journal of the ACM (JACM)
Minimizing Service and Operation Costs of Periodic Scheduling

Mathematics of Operations Research
Stride Scheduling: Deterministic Proportional- Share Resource Management

Stride Scheduling: Deterministic Proportional- Share Resource Management
m-Balanced words: a generalization of balanced words

Theoretical Computer Science
Routing Jobs to Servers with Deterministic Service Times

Mathematics of Operations Research
On the Average Waiting Time for Regular Routing to Deterministic Queues

Mathematics of Operations Research
Response time variability

Journal of Scheduling
Using aggregation to reduce response time variability in cyclic fair sequences

Journal of Scheduling

Quantified Score

Hi-index	0.00

Visualization

Abstract

The problem of routing deterministic arriving jobs to parallel servers with deterministic service times, when the job arrival rate equals the total service capacity, requires finding a periodic routing policy. Because there exist no efficient exact procedures to minimize the long-run average waiting time of arriving jobs, heuristics to construct periodic policies have been proposed. This paper presents an aggregation approach that combines servers with the same service rate, constructs a policy for the aggregated system, and then disaggregates this policy into a feasible policy for the original system. Computational experiments show that using aggregation not only reduces average waiting time but also reduces computational effort.