Data Structures, Algorithms, & Applications in C++
Chapter 12, Exercise 35
When
m = 3
the bound of Theorem 12.2 is
11/9
.
Consider the task times
5, 5, 4, 4, 3, 3, 3
. The length of the LPT schedule is
11
whereas, the length of the optimal schedule is
9
.