## Balancing of Stochastic Paced Assembly Lines - Average scenario solution ## 
Solution Log of Instance HAHN_m15_s30_01.txt
Parameters: #Tasks 53, #Stations 6, #Scenarios 30
Solution Time (master): 25,213, sum with all scenarios 63,213 seconds in total 
Realized utility work for the average solution: 446,976648381426
Expected utility work for the average solution: 135,588235294118
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 4 5 5 6 5 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 2163 2599 2981 
2135 2830 2988 3334 3128 3250 
1727 3011 2495 2692 3345 3210 
1668 1839 2295 2322 1911 2613 

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

Scenario 2
Solution Value Q: 132,13333, Bound: 132,13333
Optimal sequence:
1 4 1 2 2 1 2 2 1 3 1 2 1 2 2 

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

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

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

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

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

Scenario 8
Solution Value Q: 517,66667, Bound: 517,66667
Optimal sequence:
1 4 5 1 3 5 2 1 3 5 5 2 1 3 5 

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

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

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

Scenario 12
Solution Value Q: 1320,13333, Bound: 1320,13333
Optimal sequence:
1 4 5 3 2 2 4 5 5 3 5 3 1 3 2 

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

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

Scenario 15
Solution Value Q: 35,26667, Bound: 35,26667
Optimal sequence:
1 1 2 1 3 1 2 5 1 2 1 2 5 1 3 

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

Scenario 17
Solution Value Q: 251,20000, Bound: 251,20000
Optimal sequence:
1 2 5 4 1 4 5 2 1 4 1 4 1 5 4 

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

Scenario 19
Solution Value Q: 1247,73333, Bound: 1247,73333
Optimal sequence:
1 3 3 5 5 3 2 2 3 1 4 2 1 3 2 

Scenario 20
Solution Value Q: 421,60000, Bound: 421,60000
Optimal sequence:
1 2 5 2 2 2 1 4 5 1 2 2 2 5 2 

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

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

Scenario 23
Solution Value Q: 742,13333, Bound: 742,13333
Optimal sequence:
1 4 1 2 3 1 2 3 1 3 2 1 4 5 3 

Scenario 24
Solution Value Q: 464,20000, Bound: 464,20000
Optimal sequence:
1 2 4 1 4 1 4 1 4 1 2 3 1 2 3 

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

Scenario 26
Solution Value Q: 88,40000, Bound: 88,40000
Optimal sequence:
1 4 5 1 2 5 1 2 2 1 5 2 1 2 2 

Scenario 27
Solution Value Q: 697,86667, Bound: 697,86667
Optimal sequence:
1 3 2 1 4 1 4 1 4 1 3 5 3 1 3 

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

Scenario 29
Solution Value Q: 468,86667, Bound: 468,86667
Optimal sequence:
1 3 5 5 3 1 5 4 1 5 4 1 2 2 2 

Scenario 30
Solution Value Q: 224,26665, Bound: 224,26665
Optimal sequence:
1 3 1 2 2 1 3 1 5 4 1 2 2 1 4 
