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

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

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

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

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

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

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

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