## Balancing of Stochastic Paced Assembly Lines - Average scenario solution ## 
Solution Log of Instance HAHN_m15_s10_01.txt
Parameters: #Tasks 53, #Stations 6, #Scenarios 10
Solution Time (master): 26,599, sum with all scenarios 31,599 seconds in total 
Realized utility work for the average solution: 424,849999716655
Expected utility work for the average solution: 208,794117647059
Feasible balancing answer (station of every task): 
1 3 3 2 2 2 2 1 2 2 2 2 3 3 2 3 3 3 3 3 4 3 4 4 3 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 5 5 6 6 5 6 5 6 5 6 6 6 
Processing times in each station (odered by model (lines) and station(columns)):
2178 2276 1024 1803 552 1073 
2178 2229 2179 1880 2640 2805 
2944 2719 2707 3052 3127 3116 
3192 2522 1864 2532 3254 3116 
2026 1697 2367 2086 1859 2613 

Scenario 1
Solution Value Q: 302,76666, Bound: 302,76666
Optimal sequence:
1 2 2 1 2 2 1 5 3 1 4 1 4 1 4 

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

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

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

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

Scenario 6
Solution Value Q: 283,06667, Bound: 283,06667
Optimal sequence:
1 4 1 2 1 2 1 3 1 4 1 5 2 1 3 

Scenario 7
Solution Value Q: 156,60000, Bound: 156,60000
Optimal sequence:
1 3 1 1 2 1 1 1 5 1 3 1 4 1 5 

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

Scenario 9
Solution Value Q: 202,73333, Bound: 202,73333
Optimal sequence:
1 2 1 4 1 4 1 5 2 1 2 1 4 1 2 

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