Benchmarks
Empirical comparison of scheduling algorithms across three problem sizes.
Best Makespan (Small)
24
Achieved by Backtracking, Brute Force, Recursive
Fastest Algorithm (Small)
20.78 µs
Greedy
Completed Large Case
2 / 5
Algorithms within timeout
Execution Time by Algorithm
Average time each algorithm took to compute the schedule. Algorithms that exceeded the timeout are shown as N/A.
Greedy
Backtracking
Brute Force
Divide & Conquer
Recursive
N/A (timeout)
Makespan by Algorithm
Total completion time (makespan) of the produced schedule. Lower is better. N/A means the algorithm did not finish.
Greedy
Backtracking
Brute Force
Divide & Conquer
Recursive
N/A (timeout)
Detailed Results
All benchmark entries per case size
| Algorithm | Makespan | Avg. Time |
|---|---|---|
Greedy | 25 | 20.78 µs |
Backtracking | 24 | 122.18 µs |
Brute Force | 24 | 1.93 ms |
Divide & Conquer | 25 | 53.46 µs |
Recursive | 24 | 1.61 ms |