## Balancing of Stochastic Paced Assembly Lines - Wait-and-See solution ## 
Solution Log of Instance JAESCHKE.txt
Parameters: #Tasks 9, #Stations 6, #Scenarios 7
Solution Time: 0 of 43200 seconds (limit) in total (all scenarios)
Realized utility work for the wait-and-see solution: 0,107130869555555

Scenario 1
Solution Value Q: 0,03, Bound: 0,03
Feasible balancing answer (station of every task): 
1 3 2 3 4 5 5 4 6 
Processing times in each station (odered by model (lines) and station(columns)):
5 4 8 8 5 6 
6 8 6 11 8 6 
9 6 9 8 10 6 
7 8 9 7 8 6 
4 2 3 7 6 9 
Optimal sequence:
1 4 1 2 5 3 3 1 2 1 

Scenario 2
Solution Value Q: 0,23, Bound: 0,23
Feasible balancing answer (station of every task): 
1 3 2 3 5 4 4 5 6 
Processing times in each station (odered by model (lines) and station(columns)):
5 4 8 5 8 6 
6 8 6 8 11 6 
9 6 9 10 8 6 
7 8 9 8 7 6 
4 2 3 6 7 9 
Optimal sequence:
1 3 2 1 4 2 1 1 2 5 

Scenario 3
Solution Value Q: 0,06, Bound: 0,06
Feasible balancing answer (station of every task): 
1 3 2 3 4 5 5 4 6 
Processing times in each station (odered by model (lines) and station(columns)):
5 4 8 8 5 6 
6 8 6 11 8 6 
9 6 9 8 10 6 
7 8 9 7 8 6 
4 2 3 7 6 9 
Optimal sequence:
1 2 4 2 1 3 1 5 5 

Scenario 4
Solution Value Q: 0,04, Bound: 0,04
Feasible balancing answer (station of every task): 
1 3 2 3 5 4 4 5 6 
Processing times in each station (odered by model (lines) and station(columns)):
5 4 8 5 8 6 
6 8 6 8 11 6 
9 6 9 10 8 6 
7 8 9 8 7 6 
4 2 3 6 7 9 
Optimal sequence:
1 4 3 1 1 5 2 1 2 

Scenario 5
Solution Value Q: 0,07, Bound: 0,07
Feasible balancing answer (station of every task): 
1 3 2 3 5 4 6 5 6 
Processing times in each station (odered by model (lines) and station(columns)):
5 4 8 5 8 6 
6 8 6 7 11 7 
9 6 9 9 8 7 
7 8 9 7 7 7 
4 2 3 5 7 10 
Optimal sequence:
1 1 5 1 1 2 4 3 2 1 

Scenario 6
Solution Value Q: 0,00, Bound: 0,00
Feasible balancing answer (station of every task): 
1 3 2 3 4 5 6 4 6 
Processing times in each station (odered by model (lines) and station(columns)):
5 4 8 8 5 6 
6 8 6 11 7 7 
9 6 9 8 9 7 
7 8 9 7 7 7 
4 2 3 7 5 10 
Optimal sequence:
1 3 3 4 4 2 5 1 1 1 

Scenario 7
Solution Value Q: 0,04, Bound: 0,04
Feasible balancing answer (station of every task): 
1 3 2 3 5 4 4 5 6 
Processing times in each station (odered by model (lines) and station(columns)):
5 4 8 5 8 6 
6 8 6 8 11 6 
9 6 9 10 8 6 
7 8 9 8 7 6 
4 2 3 6 7 9 
Optimal sequence:
1 2 1 3 4 5 1 3 2 
