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

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

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

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

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

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

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

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