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

Scenario 1
Solution Value Q: 0,00, Bound: 0,00
Feasible balancing answer (station of every task): 
1 1 1 1 2 3 2 3 3 4 4 4 4 3 4 5 5 5 5 5 4 
Processing times in each station (odered by model (lines) and station(columns)):
12 17 19 17 18 
20 24 14 22 20 
31 25 26 26 26 
27 23 25 20 31 
15 13 18 14 7 
Optimal sequence:
1 5 3 1 2 3 1 2 1 4 

Scenario 2
Solution Value Q: 0,00, Bound: 0,00
Feasible balancing answer (station of every task): 
1 1 1 1 2 3 3 3 4 4 4 4 4 5 4 5 5 4 5 5 2 
Processing times in each station (odered by model (lines) and station(columns)):
12 16 19 15 21 
20 25 14 21 20 
31 22 26 29 26 
27 20 30 22 27 
15 6 18 24 4 
Optimal sequence:
1 4 1 2 5 1 2 1 3 2 

Scenario 3
Solution Value Q: 0,00, Bound: 0,00
Feasible balancing answer (station of every task): 
1 1 1 1 2 3 2 3 3 3 4 3 4 5 4 5 5 4 5 5 4 
Processing times in each station (odered by model (lines) and station(columns)):
12 17 18 15 21 
20 24 13 23 20 
31 25 24 28 26 
27 23 23 26 27 
15 13 18 17 4 
Optimal sequence:
1 5 3 2 1 1 4 5 2 

Scenario 4
Solution Value Q: 0,00, Bound: 0,00
Feasible balancing answer (station of every task): 
1 1 1 1 2 3 3 3 4 4 4 4 4 5 4 5 5 4 5 5 2 
Processing times in each station (odered by model (lines) and station(columns)):
12 16 19 15 21 
20 25 14 21 20 
31 22 26 29 26 
27 20 30 22 27 
15 6 18 24 4 
Optimal sequence:
1 3 1 2 1 1 5 4 2 

Scenario 5
Solution Value Q: 0,00, Bound: 0,00
Feasible balancing answer (station of every task): 
1 1 1 1 2 3 3 3 4 4 4 4 4 4 4 5 5 5 5 5 2 
Processing times in each station (odered by model (lines) and station(columns)):
12 16 19 18 18 
20 25 14 21 20 
31 22 26 29 26 
27 20 30 18 31 
15 6 18 21 7 
Optimal sequence:
1 3 1 1 1 4 1 2 2 5 

Scenario 6
Solution Value Q: 0,02, Bound: 0,02
Feasible balancing answer (station of every task): 
1 1 1 1 2 3 2 3 3 4 4 4 4 3 4 4 5 4 4 5 5 
Processing times in each station (odered by model (lines) and station(columns)):
12 17 19 15 20 
20 24 14 18 24 
31 25 26 29 23 
27 23 25 28 23 
15 13 18 21 0 
Optimal sequence:
1 3 1 4 1 3 1 5 4 2 

Scenario 7
Solution Value Q: 0,00, Bound: 0,00
Feasible balancing answer (station of every task): 
1 1 1 1 2 3 2 3 3 4 4 4 4 3 4 4 5 4 4 5 5 
Processing times in each station (odered by model (lines) and station(columns)):
12 17 19 15 20 
20 24 14 18 24 
31 25 26 29 23 
27 23 25 28 23 
15 13 18 21 0 
Optimal sequence:
1 4 1 2 3 5 1 2 3 
