## Balancing of Stochastic Paced Assembly Lines - Average scenario solution ## 
Solution Log of Instance HAHN_m10_s30_01.txt
Parameters: #Tasks 53, #Stations 6, #Scenarios 30
Solution Time (master): 11,247, sum with all scenarios 11,247 seconds in total 
Realized utility work for the average solution: 541,3803571
Expected utility work for the average solution: 393,411764705883
Feasible balancing answer (station of every task): 
1 3 4 2 2 2 2 1 2 2 2 2 3 3 2 4 3 4 3 3 4 3 4 4 3 3 3 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 983 1844 690 935 
2178 2229 1872 2187 2373 3072 
2944 2719 2962 2797 3076 3167 
3192 2522 1886 2510 3174 3196 
2026 1697 2291 2162 2038 2434 

Scenario 1
Solution Value Q: 536,90000, Bound: 536,90000
Optimal sequence:
1 4 1 4 1 2 2 1 4 5 

Scenario 2
Solution Value Q: 258,60000, Bound: 258,60000
Optimal sequence:
1 1 4 1 1 1 2 1 1 2 

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

Scenario 4
Solution Value Q: 388,70000, Bound: 388,70000
Optimal sequence:
1 2 5 1 4 1 2 2 1 3 

Scenario 5
Solution Value Q: 606,30000, Bound: 606,30000
Optimal sequence:
1 5 1 4 1 3 1 4 1 3 

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

Scenario 7
Solution Value Q: 820,40000, Bound: 820,40000
Optimal sequence:
1 2 5 3 1 3 2 1 3 2 

Scenario 8
Solution Value Q: 316,20000, Bound: 316,20000
Optimal sequence:
1 4 1 1 1 5 1 4 1 2 

Scenario 9
Solution Value Q: 935,60000, Bound: 935,60000
Optimal sequence:
1 3 2 1 3 1 3 2 1 3 

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

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

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

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

Scenario 14
Solution Value Q: 185,50000, Bound: 185,50000
Optimal sequence:
1 4 1 2 1 1 5 1 1 2 

Scenario 15
Solution Value Q: 888,40000, Bound: 888,40000
Optimal sequence:
1 3 2 1 4 1 4 1 3 2 

Scenario 16
Solution Value Q: 384,60000, Bound: 384,60000
Optimal sequence:
1 1 1 2 1 4 1 4 1 2 

Scenario 17
Solution Value Q: 906,60000, Bound: 906,60000
Optimal sequence:
1 2 3 1 2 5 3 2 2 2 

Scenario 18
Solution Value Q: 185,50000, Bound: 185,50000
Optimal sequence:
1 4 1 2 1 1 5 1 1 2 

Scenario 19
Solution Value Q: 395,30000, Bound: 395,30000
Optimal sequence:
1 2 1 2 2 1 2 2 1 4 

Scenario 20
Solution Value Q: 505,10000, Bound: 505,10000
Optimal sequence:
1 3 1 2 1 1 4 1 1 3 

Scenario 21
Solution Value Q: 216,60000, Bound: 216,60000
Optimal sequence:
1 2 5 1 2 2 1 5 4 5 

Scenario 22
Solution Value Q: 243,10000, Bound: 243,10000
Optimal sequence:
1 2 1 4 1 5 1 4 1 5 

Scenario 23
Solution Value Q: 185,10000, Bound: 185,10000
Optimal sequence:
1 2 1 1 1 1 3 1 1 5 

Scenario 24
Solution Value Q: 792,70000, Bound: 792,70000
Optimal sequence:
1 2 4 1 2 5 4 1 3 2 

Scenario 25
Solution Value Q: 258,60000, Bound: 258,60000
Optimal sequence:
1 1 4 1 1 1 2 1 1 2 

Scenario 26
Solution Value Q: 700,80000, Bound: 700,80000
Optimal sequence:
1 3 1 3 1 4 1 3 1 2 

Scenario 27
Solution Value Q: 411,10000, Bound: 411,10000
Optimal sequence:
1 5 3 1 2 5 1 4 1 4 

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

Scenario 29
Solution Value Q: 792,70000, Bound: 792,70000
Optimal sequence:
1 2 4 1 2 5 4 1 3 2 

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