Case (a): riSPT*

scheduling problem

Case (b): r ¯ j ,LPT**

job

work time

ordered entry, i

i = 1 ~ n

6

A

7

1

ordered entry, j

j = 1 ~ m

5

B

6

2

4

C

4

3

3

D

3

4

2

E

2

5

1

F

1

6 (m)