New answers tagged scheduling
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 ...
Top 50 recent answers are included
Related Tags
scheduling × 278algorithms × 124
optimization × 77
process-scheduling × 32
operating-systems × 26
greedy-algorithms × 24
graphs × 23
dynamic-programming × 16
approximation × 15
complexity-theory × 13
np-complete × 13
np-hard × 13
intervals × 10
parallel-computing × 9
reference-request × 7
combinatorics × 7
integer-programming × 7
computer-architecture × 6
distributed-systems × 6
linear-programming × 6
assignment-problem × 6
real-time × 6
time-complexity × 5
reductions × 5
algorithm-analysis × 4