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

Scenario 1
Solution Value Q: 0,00, Bound: 0,00
Feasible balancing answer (station of every task): 
1 1 3 5 2 3 3 3 3 3 5 4 4 4 5 5 2 3 1 5 1 5 2 2 2 3 4 5 
Processing times in each station (odered by model (lines) and station(columns)):
134 208 200 181 187 
146 220 248 136 125 
297 140 127 270 279 
217 127 245 261 225 
147 217 191 182 135 
Optimal sequence:
1 1 1 1 4 2 3 2 5 3 

Scenario 2
Solution Value Q: 0,00, Bound: 0,00
Feasible balancing answer (station of every task): 
2 1 1 3 3 1 3 3 3 3 3 4 4 4 5 5 1 3 2 2 3 4 5 2 5 3 3 5 
Processing times in each station (odered by model (lines) and station(columns)):
157 184 187 187 195 
119 185 237 140 194 
273 297 137 268 138 
259 205 213 267 131 
226 116 171 179 180 
Optimal sequence:
1 1 5 1 1 4 2 3 2 2 

Scenario 3
Solution Value Q: 0,00, Bound: 0,00
Feasible balancing answer (station of every task): 
1 1 3 3 2 2 5 1 2 2 5 3 3 5 5 5 4 5 1 2 2 4 3 4 4 5 5 5 
Processing times in each station (odered by model (lines) and station(columns)):
179 165 169 212 185 
191 235 119 227 103 
274 186 240 134 279 
187 222 287 132 247 
132 180 174 216 170 
Optimal sequence:
1 3 5 2 4 1 5 1 2 

Scenario 4
Solution Value Q: 0,00, Bound: 0,00
Feasible balancing answer (station of every task): 
1 1 3 3 4 4 5 1 1 2 4 2 2 4 4 5 4 5 3 3 3 3 3 1 5 3 3 5 
Processing times in each station (odered by model (lines) and station(columns)):
132 180 183 203 212 
254 156 153 101 211 
272 197 239 249 156 
205 284 209 219 158 
178 201 102 198 193 
Optimal sequence:
1 3 1 2 1 1 4 5 2 

Scenario 5
Solution Value Q: 0,00, Bound: 0,00
Feasible balancing answer (station of every task): 
1 1 4 5 4 5 5 1 2 2 3 4 4 5 5 4 2 5 1 3 2 5 5 2 3 3 4 5 
Processing times in each station (odered by model (lines) and station(columns)):
179 167 195 171 198 
191 156 293 125 110 
274 189 143 245 262 
187 258 79 283 268 
132 227 165 176 172 
Optimal sequence:
1 2 1 5 3 2 1 1 4 1 

Scenario 6
Solution Value Q: 0,00, Bound: 0,00
Feasible balancing answer (station of every task): 
1 1 2 4 5 3 4 1 2 2 4 3 3 4 5 3 2 5 1 4 4 5 4 5 5 3 5 5 
Processing times in each station (odered by model (lines) and station(columns)):
179 183 162 183 203 
191 140 116 196 232 
274 166 241 260 172 
187 267 254 193 174 
132 235 162 141 202 
Optimal sequence:
1 1 3 4 2 1 4 3 1 5 

Scenario 7
Solution Value Q: 0,00, Bound: 0,00
Feasible balancing answer (station of every task): 
1 2 2 4 2 4 4 2 2 2 3 3 3 5 4 4 4 4 4 5 3 3 3 1 1 4 4 5 
Processing times in each station (odered by model (lines) and station(columns)):
177 149 176 217 191 
289 262 126 63 135 
130 177 263 256 287 
119 230 273 235 218 
189 211 163 160 149 
Optimal sequence:
1 2 3 5 1 4 2 3 1 
