Scheduling jobs that arrive over time [chapter]

Cynthia Phillips, Clifford Stein, Joel Wein
1995 Lecture Notes in Computer Science  
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 t o minimize the average completion time of the set of jobs. In contrast to the problem of minimizing average completion time when ad jobs are available at time 0, ad the problems that we consider are NP-hard, and essentially nothing was known about constructing
more » ... d approximations in polynonid time. We give the first constant-factor approximation algorithms for several variants of the single and parallel machine model. 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. ' P
doi:10.1007/3-540-60220-8_53 fatcat:bwfb6ysqdjgunkvf7v3eaolzey