## Balancing of Stochastic Paced Assembly Lines - Average scenario solution ## 
Solution Log of Instance MUKHERJE.txt
Parameters: #Tasks 94, #Stations 14, #Scenarios 7
Solution Time (master): 91,52, sum with all scenarios 91,52 seconds in total 
Realized utility work for the average solution: 21,8608494444444
Expected utility work for the average solution: 0
Feasible balancing answer (station of every task): 
1 1 1 2 2 2 5 2 2 4 3 1 2 3 8 5 3 4 4 5 3 4 4 4 3 5 5 4 9 6 8 3 5 8 6 8 4 4 9 10 6 9 6 10 8 8 4 9 9 7 5 9 7 5 7 5 9 8 7 9 9 9 3 10 4 8 6 8 5 6 8 6 6 10 11 11 10 10 11 10 11 11 11 12 11 12 12 13 13 13 14 13 14 14 
Processing times in each station (odered by model (lines) and station(columns)):
314 248 229 253 214 216 262 209 230 224 235 243 262 157 
205 331 295 289 320 275 280 254 300 301 291 370 268 153 
275 349 424 372 422 426 407 417 414 415 355 330 419 279 
380 329 284 370 336 356 334 382 378 387 387 228 233 188 
213 265 312 227 301 313 255 295 235 271 272 260 41 140 

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

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

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

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

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

Scenario 6
Solution Value Q: 102,40000, Bound: 102,40000
Optimal sequence:
1 2 3 1 4 5 1 3 1 4 

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