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

Scenario 1
Solution Value Q: 0,18, Bound: 0,18
Feasible balancing answer (station of every task): 
1 2 4 1 2 3 1 
Processing times in each station (odered by model (lines) and station(columns)):
9 10 6 4 
8 7 6 3 
10 12 10 8 
10 5 6 3 
8 9 5 4 
Optimal sequence:
1 1 2 4 1 3 5 3 2 1 

Scenario 2
Solution Value Q: 0,50, Bound: 0,50
Feasible balancing answer (station of every task): 
1 2 4 1 2 3 1 
Processing times in each station (odered by model (lines) and station(columns)):
9 10 6 4 
8 7 6 3 
10 12 10 8 
10 5 6 3 
8 9 5 4 
Optimal sequence:
1 1 5 1 4 1 2 3 2 2 

Scenario 3
Solution Value Q: 0,26, Bound: 0,26
Feasible balancing answer (station of every task): 
1 2 4 1 2 3 1 
Processing times in each station (odered by model (lines) and station(columns)):
9 10 6 4 
8 7 6 3 
10 12 10 8 
10 5 6 3 
8 9 5 4 
Optimal sequence:
1 1 5 4 3 5 1 2 2 

Scenario 4
Solution Value Q: 0,15, Bound: 0,15
Feasible balancing answer (station of every task): 
1 2 4 1 2 3 1 
Processing times in each station (odered by model (lines) and station(columns)):
9 10 6 4 
8 7 6 3 
10 12 10 8 
10 5 6 3 
8 9 5 4 
Optimal sequence:
1 4 2 1 3 1 1 2 5 

Scenario 5
Solution Value Q: 0,32, Bound: 0,32
Feasible balancing answer (station of every task): 
1 2 4 1 2 3 1 
Processing times in each station (odered by model (lines) and station(columns)):
9 10 6 4 
8 7 6 3 
10 12 10 8 
10 5 6 3 
8 9 5 4 
Optimal sequence:
1 5 4 3 1 1 2 2 1 1 

Scenario 6
Solution Value Q: 0,18, Bound: 0,18
Feasible balancing answer (station of every task): 
1 2 4 1 2 3 1 
Processing times in each station (odered by model (lines) and station(columns)):
9 10 6 4 
8 7 6 3 
10 12 10 8 
10 5 6 3 
8 9 5 4 
Optimal sequence:
1 4 3 4 5 1 1 3 2 1 

Scenario 7
Solution Value Q: 0,18, Bound: 0,18
Feasible balancing answer (station of every task): 
1 2 4 1 2 3 1 
Processing times in each station (odered by model (lines) and station(columns)):
9 10 6 4 
8 7 6 3 
10 12 10 8 
10 5 6 3 
8 9 5 4 
Optimal sequence:
1 1 5 4 3 3 2 1 2 
