## Balancing of Stochastic Paced Assembly Lines - Average scenario solution ## 
Solution Log of Instance HAHN_m10_s10_01.txt
Parameters: #Tasks 53, #Stations 6, #Scenarios 10
Solution Time (master): 2,733, sum with all scenarios 2,733 seconds in total 
Realized utility work for the average solution: 579,75
Expected utility work for the average solution: 439,794117647058
Feasible balancing answer (station of every task): 
1 3 3 2 2 2 2 1 2 2 2 2 3 3 2 4 3 3 3 4 4 3 4 4 3 3 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 5 6 6 6 5 5 6 6 5 6 6 6 
Processing times in each station (odered by model (lines) and station(columns)):
2178 2276 1038 1789 690 935 
2178 2229 2076 1983 2373 3072 
2944 2719 2832 2927 3076 3167 
3192 2522 2159 2237 3174 3196 
2026 1697 2459 1994 2038 2434 

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

Scenario 2
Solution Value Q: 717,55000, Bound: 717,55000
Optimal sequence:
1 2 2 2 1 4 1 4 1 4 

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

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

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

Scenario 6
Solution Value Q: 1835,95000, Bound: 1835,95000
Optimal sequence:
1 4 3 1 4 3 1 3 2 3 

Scenario 7
Solution Value Q: 568,40000, Bound: 568,40000
Optimal sequence:
1 2 2 1 2 2 1 3 1 4 

Scenario 8
Solution Value Q: 422,20000, Bound: 422,20000
Optimal sequence:
1 1 1 2 1 4 1 1 1 3 

Scenario 9
Solution Value Q: 145,30000, Bound: 145,30000
Optimal sequence:
1 5 1 2 1 3 1 2 1 5 

Scenario 10
Solution Value Q: 223,50000, Bound: 223,50000
Optimal sequence:
1 1 4 1 2 1 5 1 1 2 
