## Balancing of Stochastic Paced Assembly Lines - Average scenario solution ## 
Solution Log of Instance TONGE70.txt
Parameters: #Tasks 70, #Stations 14, #Scenarios 7
Solution Time (master): 63,842, sum with all scenarios 63,842 seconds in total 
Realized utility work for the average solution: 11,7553277777778
Expected utility work for the average solution: 0
Feasible balancing answer (station of every task): 
1 2 3 3 3 4 5 5 3 3 5 5 6 7 1 1 2 2 3 4 6 7 7 6 8 9 10 9 8 4 9 10 9 10 10 12 12 12 12 12 6 12 13 10 14 14 14 11 13 14 12 12 12 13 13 12 7 8 8 10 10 11 11 12 12 12 14 4 7 10 
Processing times in each station (odered by model (lines) and station(columns)):
201 193 263 225 234 212 158 49 176 141 212 187 239 190 
272 210 221 225 260 344 257 234 268 292 247 253 215 266 
287 365 270 343 282 280 366 324 324 347 338 329 331 362 
329 250 306 237 286 195 188 366 325 332 238 345 251 312 
213 215 155 207 188 161 115 228 265 268 274 231 237 235 

Scenario 1
Solution Value Q: 17,85000, Bound: 17,85000
Optimal sequence:
1 3 5 1 2 4 1 3 1 2 

Scenario 2
Solution Value Q: 2,75000, Bound: 2,75000
Optimal sequence:
1 1 2 4 1 2 5 2 1 3 

Scenario 3
Solution Value Q: 2,22222, Bound: 2,22222
Optimal sequence:
1 3 1 4 5 1 2 5 2 

Scenario 4
Solution Value Q: 0,00000, Bound: 0,00000
Optimal sequence:
1 2 5 1 3 1 2 1 4 

Scenario 5
Solution Value Q: 0,00000, Bound: 0,00000
Optimal sequence:
1 4 1 3 1 2 1 1 2 5 

Scenario 6
Solution Value Q: 52,15000, Bound: 52,15000
Optimal sequence:
1 3 1 5 4 1 3 1 2 4 

Scenario 7
Solution Value Q: 55,66667, Bound: 55,66667
Optimal sequence:
1 2 5 3 1 2 4 1 3 
