6 search results - page 2 / 2 » Separating online scheduling algorithms with the relative wo... |
COCOON
2005
Springer
13 years 11 months ago
2005
Springer
We consider the problem of scheduling on-line a sequence of degradable intervals in a set of k identical machines. Our objective is to find a schedule that maximizes simultaneousl...