New answers tagged

0 votes

3 Processor Scheduling

You should be able to do this in exponential time, but much faster than n^3 operations. Get a quick upper bound by sorting the tasks in descending length, then scheduling each task in turn to the ...
gnasher729's user avatar
  • 28.4k

Top 50 recent answers are included