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

Scenario 1
Solution Value Q: 0,78, Bound: 0,78
Feasible balancing answer (station of every task): 
1 1 2 3 1 2 3 4 6 2 8 4 7 3 3 4 4 4 5 5 5 6 7 8 6 7 8 10 10 6 7 7 9 9 10 
Processing times in each station (odered by model (lines) and station(columns)):
9 44 43 38 25 32 22 51 40 44 
66 48 41 34 60 32 6 55 40 3 
49 31 47 51 61 54 62 45 66 60 
32 59 58 35 25 58 60 53 56 66 
31 46 30 64 53 39 64 36 37 44 
Optimal sequence:
1 3 1 3 1 2 5 1 4 2 

Scenario 2
Solution Value Q: 2,10, Bound: 2,10
Feasible balancing answer (station of every task): 
1 1 3 4 1 2 2 5 6 2 8 4 7 3 3 3 5 4 5 5 6 6 7 8 6 7 8 10 10 6 7 7 9 9 10 
Processing times in each station (odered by model (lines) and station(columns)):
9 46 48 24 26 38 22 51 40 44 
66 45 23 53 56 38 6 55 40 3 
49 24 52 45 63 60 62 45 66 60 
32 51 39 57 24 64 60 53 56 66 
31 46 58 29 54 45 64 36 37 44 
Optimal sequence:
1 4 2 5 1 2 1 3 1 2 

Scenario 3
Solution Value Q: 0,81, Bound: 0,81
Feasible balancing answer (station of every task): 
1 1 3 3 1 2 2 6 6 2 8 4 7 3 3 4 4 4 5 5 5 6 7 8 6 7 8 10 10 6 7 7 9 9 10 
Processing times in each station (odered by model (lines) and station(columns)):
9 46 41 33 25 37 22 51 40 44 
66 45 44 34 60 32 6 55 40 3 
49 24 54 45 61 60 62 45 66 60 
32 51 66 30 25 63 60 53 56 66 
31 46 30 59 53 44 64 36 37 44 
Optimal sequence:
1 2 5 1 4 2 5 1 3 

Scenario 4
Solution Value Q: 0,52, Bound: 0,52
Feasible balancing answer (station of every task): 
1 1 3 4 1 2 2 4 6 2 8 4 7 3 3 3 4 4 5 5 6 6 7 8 6 7 8 10 10 6 7 7 9 9 10 
Processing times in each station (odered by model (lines) and station(columns)):
9 46 48 31 19 38 22 51 40 44 
66 45 23 55 54 38 6 55 40 3 
49 24 52 53 55 60 62 45 66 60 
32 51 39 62 19 64 60 53 56 66 
31 46 58 36 47 45 64 36 37 44 
Optimal sequence:
1 2 1 3 1 2 5 1 4 

Scenario 5
Solution Value Q: 0,98, Bound: 0,98
Feasible balancing answer (station of every task): 
1 1 1 2 2 3 4 4 6 3 8 2 7 5 5 5 1 4 4 4 6 6 7 8 6 7 8 10 10 6 7 7 9 9 10 
Processing times in each station (odered by model (lines) and station(columns)):
5 28 44 28 48 38 22 51 40 44 
64 60 43 58 18 38 6 55 40 3 
52 51 22 65 43 60 62 45 66 60 
37 62 49 26 29 64 60 53 56 66 
33 27 46 54 58 45 64 36 37 44 
Optimal sequence:
1 4 1 2 1 3 1 2 1 5 

Scenario 6
Solution Value Q: 1,36, Bound: 1,36
Feasible balancing answer (station of every task): 
1 1 4 6 1 2 2 3 5 2 8 3 6 2 4 4 3 3 3 5 5 7 7 8 6 7 8 10 10 7 7 7 9 9 10 
Processing times in each station (odered by model (lines) and station(columns)):
9 46 28 48 28 27 27 51 40 44 
66 47 59 21 57 21 16 55 40 3 
49 26 36 50 63 66 65 45 66 60 
32 53 54 37 44 61 46 53 56 66 
31 48 59 56 54 32 47 36 37 44 
Optimal sequence:
1 4 5 1 3 1 4 2 1 3 

Scenario 7
Solution Value Q: 0,90, Bound: 0,90
Feasible balancing answer (station of every task): 
1 1 2 3 1 2 3 4 6 2 8 4 7 3 3 4 4 4 5 5 5 7 7 8 6 6 8 10 10 6 6 6 9 9 10 
Processing times in each station (odered by model (lines) and station(columns)):
9 44 43 38 25 38 16 51 40 44 
66 48 41 34 60 28 10 55 40 3 
49 31 47 51 61 58 58 45 66 60 
32 59 58 35 25 63 55 53 56 66 
31 46 30 64 53 42 61 36 37 44 
Optimal sequence:
1 3 1 2 5 4 2 1 3 
