## Balancing of Stochastic Paced Assembly Lines - Average scenario solution ## 
Solution Log of Instance ARC83.txt
Parameters: #Tasks 83, #Stations 12, #Scenarios 7
Solution Time (master): 159,593, sum with all scenarios 159,593 seconds in total 
Realized utility work for the average solution: 364,766794444444
Expected utility work for the average solution: 0
Feasible balancing answer (station of every task): 
1 1 1 1 10 2 2 11 9 2 4 11 2 3 5 11 3 3 3 7 3 5 3 4 3 8 5 4 4 4 4 4 5 8 6 5 9 5 5 9 6 6 6 5 7 6 7 6 8 6 6 6 7 7 7 7 7 7 7 8 8 8 8 9 9 10 10 10 8 8 8 9 9 10 10 10 11 11 11 11 12 12 12 
Processing times in each station (odered by model (lines) and station(columns)):
4482 4631 4827 3209 4112 4957 3761 3095 4429 4555 4497 4141 
5455 3261 4718 6200 5838 4492 6342 6748 5096 4596 6196 6302 
7388 8247 7781 8291 8343 7837 6816 8352 8313 7716 7628 6650 
6684 7802 6704 6057 7673 7007 7091 6325 8316 6916 5548 3681 
1924 4939 4756 5743 4855 5739 5539 4771 4755 5901 5178 1552 

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

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

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

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

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

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

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