One-Processor Scheduling of Tasks with Preferred Starting Times

We consider a new class of one-processor scheduling problems having the following form: Tasks T1,T2,...,TN are given, with each Ti having a specified length li and a preferred starting time pi. The tasks are to be scheduled nonpreemptively (i.e., a task cannot be split) on a single processor as close to their preferred starting time as possible.