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

Scenario 1
Solution Value Q: 0,00, Bound: 0,00
Feasible balancing answer (station of every task): 
1 1 1 1 2 2 1 1 3 3 2 1 2 3 2 2 3 2 3 4 4 5 5 6 5 7 3 6 4 5 7 6 6 7 6 7 1 7 7 7 7 7 1 7 7 
Processing times in each station (odered by model (lines) and station(columns)):
59 56 57 55 72 60 60 
71 75 74 82 67 64 51 
113 109 109 97 83 108 105 
94 86 83 94 73 90 104 
60 38 71 73 85 67 64 
Optimal sequence:
1 2 1 3 1 5 4 2 1 3 

Scenario 2
Solution Value Q: 0,00, Bound: 0,00
Feasible balancing answer (station of every task): 
1 1 1 1 1 5 1 2 5 5 2 1 2 2 2 2 3 2 2 4 4 5 3 6 3 6 6 6 5 6 4 6 7 7 7 7 2 7 1 7 7 7 3 7 7 
Processing times in each station (odered by model (lines) and station(columns)):
58 39 71 55 71 69 56 
61 87 70 89 62 60 55 
103 111 81 99 109 114 107 
79 107 83 100 74 79 102 
40 41 89 74 85 68 61 
Optimal sequence:
1 2 1 4 1 3 1 2 2 5 

Scenario 3
Solution Value Q: 0,00, Bound: 0,00
Feasible balancing answer (station of every task): 
1 2 1 3 2 3 1 3 5 7 1 1 1 3 1 2 3 1 2 2 4 6 2 5 6 7 4 6 4 6 5 5 5 5 7 6 1 7 1 7 7 7 1 7 7 
Processing times in each station (odered by model (lines) and station(columns)):
65 55 39 60 52 78 70 
59 81 77 85 78 58 46 
114 93 99 98 99 107 114 
87 99 85 88 95 61 109 
47 55 62 74 83 81 56 
Optimal sequence:
1 2 4 5 1 5 1 2 3 

Scenario 4
Solution Value Q: 0,00, Bound: 0,00
Feasible balancing answer (station of every task): 
1 3 2 5 2 6 3 3 3 6 1 1 1 3 1 2 5 1 3 4 4 5 1 2 6 7 5 5 6 3 5 3 7 7 7 7 1 7 6 7 7 7 1 7 7 
Processing times in each station (odered by model (lines) and station(columns)):
64 58 47 55 65 68 62 
69 83 59 78 53 81 61 
108 104 110 92 111 86 113 
85 88 111 90 58 80 112 
65 29 78 68 76 78 64 
Optimal sequence:
1 2 1 3 1 2 5 4 1 

Scenario 5
Solution Value Q: 0,00, Bound: 0,00
Feasible balancing answer (station of every task): 
1 1 5 1 6 2 1 2 6 2 1 1 1 3 1 2 4 1 2 2 3 4 5 6 5 6 4 4 5 6 7 4 7 7 7 7 5 7 6 7 7 7 5 7 7 
Processing times in each station (odered by model (lines) and station(columns)):
63 56 55 55 69 65 56 
67 89 101 32 79 50 66 
107 106 112 89 91 105 114 
73 112 103 51 74 99 112 
52 61 64 60 84 70 67 
Optimal sequence:
1 2 5 1 3 1 1 4 1 2 

Scenario 6
Solution Value Q: 0,02, Bound: 0,00
Feasible balancing answer (station of every task): 
3 1 1 2 2 2 3 1 4 4 1 1 1 4 1 3 4 2 3 3 5 6 3 2 6 6 4 6 6 5 4 6 7 7 7 7 1 7 1 7 7 7 1 7 7 
Processing times in each station (odered by model (lines) and station(columns)):
58 59 59 57 60 70 56 
68 80 70 78 80 53 55 
104 108 99 108 96 102 107 
97 82 98 83 89 73 102 
55 64 60 70 68 80 61 
Optimal sequence:
1 3 1 4 5 2 4 1 3 1 

Scenario 7
Solution Value Q: 0,00, Bound: 0,00
Feasible balancing answer (station of every task): 
2 1 3 3 6 3 4 3 6 4 1 1 1 4 1 1 5 1 1 1 2 3 4 6 5 6 5 5 6 6 5 5 7 7 7 7 3 7 7 7 7 7 3 7 7 
Processing times in each station (odered by model (lines) and station(columns)):
59 55 57 60 67 60 61 
88 81 72 72 62 54 55 
95 102 110 100 100 110 107 
93 84 74 93 75 95 110 
36 64 74 65 83 70 66 
Optimal sequence:
1 1 3 2 5 4 2 1 3 
