## Balancing of Stochastic Paced Assembly Lines - Average scenario solution ## 
Solution Log of Instance HAHN_m15_s20_01.txt
Parameters: #Tasks 53, #Stations 6, #Scenarios 20
Solution Time (master): 21,5, sum with all scenarios 41,5 seconds in total 
Realized utility work for the average solution: 407,886666666667
Expected utility work for the average solution: 42,1764705882353
Feasible balancing answer (station of every task): 
1 1 1 1 1 1 1 2 2 2 2 2 2 2 3 4 3 2 3 4 4 3 4 4 3 4 4 4 4 4 4 4 4 4 4 4 4 4 5 5 5 5 6 6 6 5 6 6 6 5 6 6 6 
Processing times in each station (odered by model (lines) and station(columns)):
1351 1926 1885 1984 687 1073 
1849 1790 2529 2063 2608 3072 
2135 2830 2988 3092 3256 3364 
1727 3011 2495 2564 3371 3312 
1668 1839 2295 2322 1911 2613 

Scenario 1
Solution Value Q: 0,00000, Bound: 0,00000
Optimal sequence:
1 2 1 2 1 3 1 2 1 3 1 2 1 5 5 

Scenario 2
Solution Value Q: 262,73333, Bound: 262,73333
Optimal sequence:
1 3 5 2 1 3 1 2 2 1 5 3 1 2 2 

Scenario 3
Solution Value Q: 376,00000, Bound: 376,00000
Optimal sequence:
1 2 5 4 1 3 1 3 2 1 4 1 3 1 3 

Scenario 4
Solution Value Q: 76,00000, Bound: 76,00000
Optimal sequence:
1 2 2 1 2 5 1 3 5 1 4 5 1 5 2 

Scenario 5
Solution Value Q: 1597,20000, Bound: 1597,20000
Optimal sequence:
1 4 2 3 1 4 3 2 3 2 1 3 2 3 4 

Scenario 6
Solution Value Q: 310,66667, Bound: 310,66667
Optimal sequence:
1 2 2 2 1 3 1 2 5 3 1 2 2 1 3 

Scenario 7
Solution Value Q: 138,46667, Bound: 138,46667
Optimal sequence:
1 2 2 1 3 1 5 4 1 5 2 1 3 1 3 

Scenario 8
Solution Value Q: 12,53333, Bound: 12,53333
Optimal sequence:
1 4 1 2 5 1 2 5 1 3 1 5 2 1 3 

Scenario 9
Solution Value Q: 527,40000, Bound: 527,40000
Optimal sequence:
1 3 2 1 4 1 3 5 5 3 1 4 1 2 3 

Scenario 10
Solution Value Q: 590,60000, Bound: 590,60000
Optimal sequence:
1 2 2 5 4 1 2 3 1 2 3 2 1 2 3 

Scenario 11
Solution Value Q: 0,00000, Bound: 0,00000
Optimal sequence:
1 5 5 1 4 1 2 1 4 1 4 1 2 1 2 

Scenario 12
Solution Value Q: 1062,66667, Bound: 1062,66667
Optimal sequence:
1 3 5 4 2 1 4 2 4 2 3 2 1 3 2 

Scenario 13
Solution Value Q: 960,86667, Bound: 960,86667
Optimal sequence:
1 4 5 4 2 3 5 2 5 4 1 2 4 2 2 

Scenario 14
Solution Value Q: 0,00000, Bound: 0,00000
Optimal sequence:
1 4 1 2 1 3 1 4 1 1 2 1 2 1 2 

Scenario 15
Solution Value Q: 74,33333, Bound: 74,33333
Optimal sequence:
1 2 2 1 4 1 2 5 1 2 2 1 3 1 2 

Scenario 16
Solution Value Q: 138,46667, Bound: 138,46667
Optimal sequence:
1 2 2 1 3 1 5 4 1 5 2 1 3 1 3 

Scenario 17
Solution Value Q: 527,06667, Bound: 527,06667
Optimal sequence:
1 2 2 5 4 1 4 5 2 5 2 2 1 3 2 

Scenario 18
Solution Value Q: 118,66667, Bound: 118,66667
Optimal sequence:
1 2 2 1 3 1 5 4 1 2 2 1 4 1 3 

Scenario 19
Solution Value Q: 1341,40000, Bound: 1341,40000
Optimal sequence:
1 3 2 5 5 2 2 2 2 3 2 2 3 2 4 

Scenario 20
Solution Value Q: 42,66667, Bound: 42,66667
Optimal sequence:
1 2 1 3 1 2 1 4 1 5 5 1 3 1 3 
