A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is
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 constructingdoi:10.1007/3-540-60220-8_53 fatcat:bwfb6ysqdjgunkvf7v3eaolzey