## Balancing of Stochastic Paced Assembly Lines - Average scenario solution ## 
Solution Log of Instance BARTHOLD.txt
Parameters: #Tasks 148, #Stations 9, #Scenarios 7
Solution Time (master): 2,627, sum with all scenarios 2,627 seconds in total 
Realized utility work for the average solution: 14,1964455555556
Expected utility work for the average solution: 0
Feasible balancing answer (station of every task): 
1 1 1 2 1 1 1 2 1 2 5 5 9 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 1 2 1 1 1 1 2 3 3 3 3 4 3 6 8 3 3 3 8 5 3 3 2 9 3 6 1 6 2 1 9 2 4 4 1 3 3 4 4 5 6 9 4 1 1 2 3 3 3 6 6 6 6 6 6 8 2 3 6 9 4 8 1 6 5 4 1 8 4 3 3 4 6 5 5 8 6 6 7 8 9 4 4 4 6 9 5 7 7 9 4 4 6 5 8 9 8 7 4 6 6 8 7 7 7 7 9 9 1 3 8 1 4 8 5 5 8 9 8 
Processing times in each station (odered by model (lines) and station(columns)):
425 518 419 346 533 600 578 489 525 
635 578 557 603 661 571 487 615 735 
765 829 802 894 735 873 679 752 655 
729 709 795 594 670 618 750 641 611 
569 523 300 673 312 280 708 553 399 

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

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

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

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

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

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

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