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

Scenario 1
Solution Value Q: 0,34, Bound: 0,34
Feasible balancing answer (station of every task): 
2 1 3 2 4 3 5 4 
Processing times in each station (odered by model (lines) and station(columns)):
17 16 21 11 10 
0 16 13 17 10 
17 18 14 20 17 
13 22 20 13 8 
21 19 9 0 6 
Optimal sequence:
1 2 3 4 5 1 2 1 3 1 

Scenario 2
Solution Value Q: 1,25, Bound: 1,25
Feasible balancing answer (station of every task): 
2 1 3 2 4 3 5 5 
Processing times in each station (odered by model (lines) and station(columns)):
17 16 21 8 13 
0 16 13 14 13 
17 18 14 15 22 
13 22 20 8 13 
21 19 9 0 6 
Optimal sequence:
1 2 1 5 4 2 1 3 2 1 

Scenario 3
Solution Value Q: 0,59, Bound: 0,59
Feasible balancing answer (station of every task): 
2 1 3 2 4 3 5 4 
Processing times in each station (odered by model (lines) and station(columns)):
17 16 21 11 10 
0 16 13 17 10 
17 18 14 20 17 
13 22 20 13 8 
21 19 9 0 6 
Optimal sequence:
1 5 1 2 1 5 4 3 2 

Scenario 4
Solution Value Q: 0,36, Bound: 0,36
Feasible balancing answer (station of every task): 
2 1 3 2 4 3 5 5 
Processing times in each station (odered by model (lines) and station(columns)):
17 16 21 8 13 
0 16 13 14 13 
17 18 14 15 22 
13 22 20 8 13 
21 19 9 0 6 
Optimal sequence:
1 5 4 1 2 3 1 1 2 

Scenario 5
Solution Value Q: 0,77, Bound: 0,77
Feasible balancing answer (station of every task): 
2 1 3 2 4 3 5 5 
Processing times in each station (odered by model (lines) and station(columns)):
17 16 21 8 13 
0 16 13 14 13 
17 18 14 15 22 
13 22 20 8 13 
21 19 9 0 6 
Optimal sequence:
1 1 1 3 2 1 5 4 1 2 

Scenario 6
Solution Value Q: 0,50, Bound: 0,50
Feasible balancing answer (station of every task): 
2 1 3 2 4 3 5 5 
Processing times in each station (odered by model (lines) and station(columns)):
17 16 21 8 13 
0 16 13 14 13 
17 18 14 15 22 
13 22 20 8 13 
21 19 9 0 6 
Optimal sequence:
1 3 2 1 5 4 3 1 1 4 

Scenario 7
Solution Value Q: 0,31, Bound: 0,31
Feasible balancing answer (station of every task): 
2 1 3 2 4 3 5 4 
Processing times in each station (odered by model (lines) and station(columns)):
17 16 21 11 10 
0 16 13 17 10 
17 18 14 20 17 
13 22 20 13 8 
21 19 9 0 6 
Optimal sequence:
1 1 3 2 1 5 4 3 2 
