Published on *Computer Science Department at Princeton University* (http://www.cs.princeton.edu)

We consider a new class of one-processor scheduling problems having the following form: Tasks T1, T2 ...,TN are given, with each T, having a specified length l, and a preferred starting time p sub i. The tasks are to be scheduled nonpreemptively (i.e., a task cannot be split) on a single processor as close to their preferred starting times as possible. We examine two different cost measures for such schedules, the sum of the individual discrepancies from the preferred starting times and the maximum such discrepancy. For the first of these, we show that the problem of finding minimum cost schedules is NP-complete; however, we give an efficient algorithm that finds minimum cost schedules whenever the tasks either all have the same length or are required to be executed in a given fixed sequence. For the second cost measure, we give an

efficient algorithm that finds minimum cost schedules in general, with no constraints on the ordering or lengths of the tasks.

**Links**

[1] http://www.cs.princeton.edu/research/techreps/author/53

[2] http://www.cs.princeton.edu/research/techreps/author/384

[3] http://www.cs.princeton.edu/research/techreps/author/241

[4] ftp://ftp.cs.princeton.edu/techreports/1986/049.pdf