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

Scenario 1
Solution Value Q: 0,32, Bound: 0,32
Feasible balancing answer (station of every task): 
2 1 2 1 1 1 3 2 3 3 3 
Processing times in each station (odered by model (lines) and station(columns)):
56 49 58 
46 59 3 
68 82 70 
73 22 79 
74 44 42 
Optimal sequence:
1 5 3 1 2 4 2 1 3 1 

Scenario 2
Solution Value Q: 0,57, Bound: 0,57
Feasible balancing answer (station of every task): 
2 1 2 1 1 1 3 2 3 3 3 
Processing times in each station (odered by model (lines) and station(columns)):
56 49 58 
46 59 3 
68 82 70 
73 22 79 
74 44 42 
Optimal sequence:
1 4 2 2 1 5 1 3 1 2 

Scenario 3
Solution Value Q: 0,48, Bound: 0,48
Feasible balancing answer (station of every task): 
1 1 2 2 1 2 1 3 1 3 3 
Processing times in each station (odered by model (lines) and station(columns)):
66 53 44 
33 65 10 
80 83 57 
70 21 83 
57 53 50 
Optimal sequence:
1 2 4 3 1 5 2 5 1 

Scenario 4
Solution Value Q: 0,25, Bound: 0,25
Feasible balancing answer (station of every task): 
2 1 2 1 1 1 3 2 3 3 3 
Processing times in each station (odered by model (lines) and station(columns)):
56 49 58 
46 59 3 
68 82 70 
73 22 79 
74 44 42 
Optimal sequence:
1 3 1 2 4 1 2 1 5 

Scenario 5
Solution Value Q: 0,45, Bound: 0,45
Feasible balancing answer (station of every task): 
2 1 2 1 1 1 3 2 3 3 3 
Processing times in each station (odered by model (lines) and station(columns)):
56 49 58 
46 59 3 
68 82 70 
73 22 79 
74 44 42 
Optimal sequence:
1 3 1 5 1 2 4 1 2 1 

Scenario 6
Solution Value Q: 0,80, Bound: 0,80
Feasible balancing answer (station of every task): 
1 1 2 2 1 2 1 3 1 3 3 
Processing times in each station (odered by model (lines) and station(columns)):
66 53 44 
33 65 10 
80 83 57 
70 21 83 
57 53 50 
Optimal sequence:
1 1 4 2 5 1 3 4 1 3 

Scenario 7
Solution Value Q: 0,37, Bound: 0,37
Feasible balancing answer (station of every task): 
2 1 2 1 1 1 3 2 3 3 3 
Processing times in each station (odered by model (lines) and station(columns)):
56 49 58 
46 59 3 
68 82 70 
73 22 79 
74 44 42 
Optimal sequence:
1 2 4 2 3 1 5 1 3 
