22 lines
464 B
Text
22 lines
464 B
Text
Encodage : ordre des jobs [0,0,1,1,0,1]
|
|
=> job 0 puis job 0 puis 1 ...
|
|
Du coup :
|
|
J0T0 -> machine0 [0,3]
|
|
J0T1 -> machine1 [3,6]
|
|
J1T0 -> machine1 [6,8]
|
|
J1T1 -> machine0 [8,10]
|
|
J0T2 -> machine2 [6,8]
|
|
J1T2 -> machine2 [10,14]
|
|
|
|
Validé par experimentation
|
|
|
|
Version optimum
|
|
|
|
J0T0 -> machine0 [0,3]
|
|
J1T0 -> machine1 [0,2]
|
|
J0T1 -> machine1 [3,6]
|
|
J1T1 -> machine0 [3,5]
|
|
J1T2 -> machine2 [5,9]
|
|
J0T2 -> machine2 [9,11]
|
|
|
|
Attention SI SOLUTION PAS POSSIBLE, RAISE EXCEPTION
|