Minimizing average completion time in the presence of release dates

Minimizing average completion time in the presence of release dates

0.00 Avg rating0 Votes
Article ID: iaor2000167
Country: Netherlands
Volume: 82
Issue: 1/2
Start Page Number: 199
End Page Number: 223
Publication Date: Jun 1998
Journal: Mathematical Programming
Authors: , ,
Keywords: programming: mathematical
Abstract:

A natural and basic problem in scheduling theory is to provide good average quality of service to a stream of jobs that arrive over time. In this paper we consider the problem of scheduling n jobs that are released over time in order to minimize the average completion time of the set of jobs. In contrast to the problem of minimizing average completion time when all jobs are available at time 0, all the problems that we consider are NP-hard, and essentially nothing was known about constructing good approximations in polynomial time. We give the first constant-factor approximation algorithms for several variants of the single and parallel machine models. Many of the algorithms are based on interesting algorithmic and structural relationships between preemptive and nonpreemptive schedules and linear programming relaxations of both. Many of the algorithms generalize to the minimization of average weighted completion time as well.

Reviews

Required fields are marked *. Your email address will not be published.