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

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

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

Scenario 3
Solution Value Q: 2,02, Bound: 2,02
Feasible balancing answer (station of every task): 
1 1 2 6 4 4 6 7 7 3 7 1 2 2 5 3 8 9 10 3 4 5 5 3 6 7 8 9 9 10 
Processing times in each station (odered by model (lines) and station(columns)):
30 36 37 27 30 27 24 25 10 18 
30 46 17 28 38 35 23 34 24 19 
32 47 45 47 32 45 48 22 43 37 
44 46 42 48 46 38 46 46 38 16 
31 37 39 8 26 25 22 2 33 21 
Optimal sequence:
1 4 5 2 3 5 1 1 2 

Scenario 4
Solution Value Q: 1,02, Bound: 1,02
Feasible balancing answer (station of every task): 
1 1 2 5 4 4 5 6 6 3 6 1 2 2 7 3 8 9 10 3 4 7 7 3 5 6 8 9 9 10 
Processing times in each station (odered by model (lines) and station(columns)):
30 36 37 27 27 24 30 25 10 18 
30 46 17 28 35 23 38 34 24 19 
32 47 45 47 45 48 32 22 43 37 
44 46 42 48 38 46 46 46 38 16 
31 37 39 8 25 22 26 2 33 21 
Optimal sequence:
1 4 1 1 1 2 3 5 2 

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

Scenario 6
Solution Value Q: 1,91, Bound: 1,91
Feasible balancing answer (station of every task): 
1 1 2 5 4 4 5 6 6 3 6 1 2 2 7 3 8 9 10 3 4 7 7 3 5 6 8 9 9 10 
Processing times in each station (odered by model (lines) and station(columns)):
30 36 37 27 27 24 30 25 10 18 
30 46 17 28 35 23 38 34 24 19 
32 47 45 47 45 48 32 22 43 37 
44 46 42 48 38 46 46 46 38 16 
31 37 39 8 25 22 26 2 33 21 
Optimal sequence:
1 3 2 3 1 1 4 5 4 1 

Scenario 7
Solution Value Q: 1,41, Bound: 1,41
Feasible balancing answer (station of every task): 
1 1 2 5 4 4 6 6 7 3 9 1 2 2 5 3 7 7 10 3 4 5 7 3 6 7 8 9 9 10 
Processing times in each station (odered by model (lines) and station(columns)):
30 36 37 27 24 17 36 25 14 18 
30 46 17 28 32 35 29 34 24 19 
32 47 45 47 45 48 30 20 47 37 
44 46 42 48 48 38 48 44 36 16 
31 37 39 8 16 24 31 0 37 21 
Optimal sequence:
1 3 1 2 1 4 5 2 3 
