Go backward to
Graham's List Scheduling Algorithm
Go up to
Top
Go forward to
Coffman-Graham Algorithm
Coffman-Graham Algorithm
What is best way to construct prioritized list?
Assume all tasks execute the
same
amount of time.
mu
(T
i
) = 1
.
Definitions:
If
T
i
< T
j
, then
T
j
is an
immediate successor
of
T
i
.
Let
S(T
i
)
be all immediate successors of
T
i
.
Let
alpha
(T)
be an integer label assigned to
T
.
Let
N(T
i
)
be the ordered sequence of integers formed from the set
{
alpha
(T') | T'
in
S(T) }
.
Author:
Wolfgang Schreiner
Last modification: November 15, 1996