Next: MINIMUM STORAGE-TIME SEQUENCING
Up: Sequencing on One Processor
Previous: Sequencing on One Processor
Set T of tasks, for each task
a length ,
and a deadline ,
a subset ,
a positive integer K.
A one-processor schedule
for T such that the sum of w(t),
taken over all
does not exceed
Cardinality of jobs in S completed by the deadline.
- Bad News:
Not approximable within
- Garey and Johnson: Similar to SS3