Using aggregation to reduce response time variability in cyclic fair sequences

Authors:
Jeffrey W. Herrmann
Affiliations:
Department of Mechanical Engineering, University of Maryland, College Park, USA 20742
Venue:
Journal of Scheduling
Year:
2011

Citing 5
Cited 2

Minimizing Service and Operation Costs of Periodic Scheduling

Mathematics of Operations Research
Nearly optimal perfectly periodic schedules

Distributed Computing - Special issue: Selected papers from PODC '01
Stride Scheduling: Deterministic Proportional- Share Resource Management

Stride Scheduling: Deterministic Proportional- Share Resource Management
Response time variability

Journal of Scheduling
Solving the Response Time Variability Problem by means of metaheuristics

Proceedings of the 2006 conference on Artificial Intelligence Research and Development

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

Journal of Scheduling
A branch and bound algorithm for the response time variability problem

Journal of Scheduling

Quantified Score

Hi-index	0.00

Visualization

Abstract

Fair sequences are useful in a variety of applications, including manufacturing and computer systems. This paper considers the generation of cyclic fair sequences for a given set of products, each of which must be produced multiple times in each cycle. The objective is to create a sequence so that, for each product, the variability of the time between consecutive completions is minimized. Because minimizing response time variability is known to be NP-hard and the performance of existing heuristics is poor for certain classes of problems, we present an aggregation approach that combines products with the same demand, creates a sequence for the aggregated instance, and then disaggregates this solution into a feasible sequence for the original instance. Computational experiments show that using aggregation can reduce response time variability dramatically and also reduces computational effort.