Time is slotted, t= 1,€¦,T. p(t) kW of power is available in slot t. There are n = 1,€¦ ,N tasks. Task n needs 1kW for a duration h(n) slots: it is flexible in that any h(n) out of T slots will work, i.e. the task is pre-emptible. Let d(t) be the number of tasks that require at least t slots, so d(1) ‰¥d(2) €¦ ‰¥d(T). Order the time slots so tha...
Creator:
Varaiya, Pravin (University of California, Berkeley)
Created:
2016-05-09
Contributed By:
University of Minnesota, Institute for Mathematics and its Applications.