Write (2.40) for each release time t1 and each deadline t2 (t1 2) in the problem of Table 2.11. Verify that (2.41) are the non-redundant inequalities.
Table: Data for a machine scheduling problem:-
| |
|
|
Processing
time |
Job
j |
Release time rj |
Dead-line dj
|
PAj |
PBj |
|
1
|
0
|
10
|
1
|
5
|
|
2
|
0
|
10
|
3
|
6
|
|
3
|
2
|
7
|
3
|
7
|
|
4
|
2
|
10
|
4
|
6
|
|
5
|
4
|
7
|
2
|
5
|