We consider one-processor scheduling problems having the following form: Tasks T//1,T//2,. . . ,T//N are given, with each T//i having a specified length l//i and a preferred starting time a//i (or, equivalently, a preferred completion time b//i). The tasks are to be scheduled nonpreemptively (i. e. , a task cannot be split) on a single processor to begin as close to their preferred starting times as possible. We examine two different cost measures for such schedules. 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 task.
All Science Journal Classification (ASJC) codes
- Computer Science Applications
- Management Science and Operations Research