## Balancing of Stochastic Paced Assembly Lines - Average scenario solution ## 
Solution Log of Instance HAHN_m10_s20_01.txt
Parameters: #Tasks 53, #Stations 6, #Scenarios 20
Solution Time (master): 260,917, sum with all scenarios 260,917 seconds in total 
Realized utility work for the average solution: 555,42
Expected utility work for the average solution: 25,8235294117647
Feasible balancing answer (station of every task): 
1 1 1 1 1 2 1 2 2 2 2 2 2 2 3 4 3 4 3 4 3 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 5 4 4 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)):
1255 1897 1895 1816 970 1073 
1849 1709 2424 2066 2791 3072 
2052 2913 2838 3084 3414 3364 
1585 2995 2528 2907 3153 3312 
1551 1775 2144 2208 2357 2613 

Scenario 1
Solution Value Q: 1449,50000, Bound: 1449,50000
Optimal sequence:
1 4 2 4 3 2 1 3 2 3 

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

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

Scenario 4
Solution Value Q: 1919,60000, Bound: 1919,60000
Optimal sequence:
1 4 3 4 4 1 3 3 4 5 

Scenario 5
Solution Value Q: 1211,80000, Bound: 1211,80000
Optimal sequence:
1 3 2 4 2 1 2 3 2 3 

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

Scenario 7
Solution Value Q: 587,90000, Bound: 587,90000
Optimal sequence:
1 4 5 2 2 1 2 5 2 3 

Scenario 8
Solution Value Q: 233,10000, Bound: 233,10000
Optimal sequence:
1 2 4 1 4 2 1 4 1 3 

Scenario 9
Solution Value Q: 411,50000, Bound: 411,50000
Optimal sequence:
1 4 2 1 2 2 2 1 2 3 

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

Scenario 11
Solution Value Q: 2158,80000, Bound: 2158,80000
Optimal sequence:
2 4 2 4 4 5 4 4 4 5 

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

Scenario 13
Solution Value Q: 262,50000, Bound: 262,50000
Optimal sequence:
1 4 1 3 1 4 1 4 1 3 

Scenario 14
Solution Value Q: 135,70000, Bound: 135,70000
Optimal sequence:
1 2 4 1 3 1 2 2 1 4 

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

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

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

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

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

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