The problem: ↵
INPUT: say that we have a Mressourcestask that we MUST usedo, for each ressourcetask i you can usedo it from Xi to Yi (an interval of hours)↵
↵
and you must use eachprocess for X hours and X <=(Yi-Xi+1)↵
↵
those resstask for minimim of X hources can be used only by cpus.d X <=(Yi-Xi+1)↵
↵
↵
for each cpu, it can't use tworessourcetasks in the same time.↵
↵
output: give me the minimum number of cpus neeeded an theressourcetasks used by each cpu.↵
↵
(I got a solution for M<22 and number of hours and X is small like binary search on number of cpus and dp bitmask to check if there is a solution) ↵
↵
complexity is high! how we can do better? for bigger M↵
↵
feel free to say every idea that you have for any constraint.
INPUT: say that we have a M
↵
and you must use each
↵
those ress
↵
↵
for each cpu, it can't use two
↵
output: give me the minimum number of cpus neeeded an the
↵
(I got a solution for M<22 and number of hours and X is small like binary search on number of cpus and dp bitmask to check if there is a solution) ↵
↵
complexity is high! how we can do better? for bigger M↵
↵
feel free to say every idea that you have for any constraint.
