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

Scenario 1
Solution Value Q: 0,97, Bound: 0,97
Feasible balancing answer (station of every task): 
3 1 2 2 3 2 1 4 3 4 5 5 3 4 6 4 5 7 6 6 7 7 8 9 7 5 8 9 10 
Processing times in each station (odered by model (lines) and station(columns)):
27 30 30 23 16 24 15 35 21 0 
42 42 26 38 33 40 26 26 22 25 
32 32 44 44 41 30 42 44 12 30 
33 18 32 38 44 41 43 34 34 38 
8 18 26 39 36 30 42 36 20 0 
Optimal sequence:
1 2 5 2 1 3 1 4 1 3 

Scenario 2
Solution Value Q: 3,47, Bound: 3,47
Feasible balancing answer (station of every task): 
3 1 2 2 3 2 1 4 3 4 5 5 3 4 6 4 5 7 6 6 7 7 8 9 7 5 8 9 10 
Processing times in each station (odered by model (lines) and station(columns)):
27 30 30 23 16 24 15 35 21 0 
42 42 26 38 33 40 26 26 22 25 
32 32 44 44 41 30 42 44 12 30 
33 18 32 38 44 41 43 34 34 38 
8 18 26 39 36 30 42 36 20 0 
Optimal sequence:
1 4 1 2 3 1 1 2 5 2 

Scenario 3
Solution Value Q: 1,69, Bound: 1,69
Feasible balancing answer (station of every task): 
2 3 1 1 2 4 1 4 2 3 5 5 2 3 6 4 5 7 6 6 7 7 8 9 7 3 8 9 10 
Processing times in each station (odered by model (lines) and station(columns)):
28 30 21 33 14 24 15 35 21 0 
43 26 44 35 33 40 26 26 22 25 
37 44 36 38 38 30 42 44 12 30 
17 32 38 36 42 41 43 34 34 38 
26 26 14 27 34 30 42 36 20 0 
Optimal sequence:
1 3 1 5 2 5 2 1 4 

Scenario 4
Solution Value Q: 0,65, Bound: 0,65
Feasible balancing answer (station of every task): 
3 1 2 2 3 2 1 4 3 4 5 5 3 4 6 4 5 7 6 6 7 7 8 9 7 5 8 9 10 
Processing times in each station (odered by model (lines) and station(columns)):
27 30 30 23 16 24 15 35 21 0 
42 42 26 38 33 40 26 26 22 25 
32 32 44 44 41 30 42 44 12 30 
33 18 32 38 44 41 43 34 34 38 
8 18 26 39 36 30 42 36 20 0 
Optimal sequence:
1 2 5 2 1 3 1 4 1 

Scenario 5
Solution Value Q: 1,03, Bound: 1,03
Feasible balancing answer (station of every task): 
3 1 2 2 3 2 1 4 3 4 5 5 3 4 6 4 5 7 6 6 7 7 8 9 7 5 8 9 10 
Processing times in each station (odered by model (lines) and station(columns)):
27 30 30 23 16 24 15 35 21 0 
42 42 26 38 33 40 26 26 22 25 
32 32 44 44 41 30 42 44 12 30 
33 18 32 38 44 41 43 34 34 38 
8 18 26 39 36 30 42 36 20 0 
Optimal sequence:
1 1 4 1 3 1 2 1 5 2 

Scenario 6
Solution Value Q: 0,97, Bound: 0,97
Feasible balancing answer (station of every task): 
3 1 2 2 3 2 1 4 2 4 5 5 3 4 6 4 5 7 6 6 7 7 8 9 7 5 8 9 10 
Processing times in each station (odered by model (lines) and station(columns)):
27 32 28 23 16 24 15 35 21 0 
42 45 23 38 33 40 26 26 22 25 
32 35 41 44 41 30 42 44 12 30 
33 20 30 38 44 41 43 34 34 38 
8 20 24 39 36 30 42 36 20 0 
Optimal sequence:
1 4 1 4 1 3 2 5 1 3 

Scenario 7
Solution Value Q: 1,30, Bound: 1,30
Feasible balancing answer (station of every task): 
3 1 2 2 3 2 1 4 3 4 5 5 3 4 6 4 5 7 6 6 7 7 8 9 7 5 8 9 10 
Processing times in each station (odered by model (lines) and station(columns)):
27 30 30 23 16 24 15 35 21 0 
42 42 26 38 33 40 26 26 22 25 
32 32 44 44 41 30 42 44 12 30 
33 18 32 38 44 41 43 34 34 38 
8 18 26 39 36 30 42 36 20 0 
Optimal sequence:
1 4 1 3 1 3 2 5 2 
