| Name | Scheduling/Scheduling-os-taillard/ Taillard-os-07-07-8.xml |
| MD5SUM | 3801e67c429176a130b0cb7922d17a7f |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 458 |
| Best CPU time to get the best result obtained on this benchmark | 140.11501 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 203 |
| Number of constraints | 168 |
| Number of domains | 9 |
| Minimum domain size | 6 |
| Maximum domain size | 560 |
| Distribution of domain sizes | [{"size":6,"count":7},{"size":7,"count":91},{"size":560,"count":105}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 8 |
| Distribution of variable degrees | [{"degree":2,"count":56},{"degree":3,"count":98},{"degree":8,"count":49}] |
| Minimum constraint arity | 1 |
| Maximum constraint arity | 9 |
| Distribution of constraint arities | [{"arity":1,"count":7},{"arity":2,"count":49},{"arity":3,"count":49},{"arity":7,"count":14},{"arity":9,"count":49}] |
| Number of extensional constraints | 49 |
| Number of intensional constraints | 56 |
| Distribution of constraint types | [{"type":"extension","count":49},{"type":"intension","count":56},{"type":"allDifferent","count":7},{"type":"noOverlap","count":7},{"type":"element","count":49}] |
| Optimization problem | YES |
| Type of objective | min MAXIMUM |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 458<instantiation type="optimum" cost="458"> <list> s[0][0] s[0][1] s[0][2] s[0][3] s[0][4] s[0][5] s[0][6] s[1][0] s[1][1] s[1][2] s[1][3] s[1][4] s[1][5] s[1][6] s[2][0] s[2][1] s[2][2] s[2][3] s[2][4] s[2][5] s[2][6] s[3][0] s[3][1] s[3][2] s[3][3] s[3][4] s[3][5] s[3][6] s[4][0] s[4][1] s[4][2] s[4][3] s[4][4] s[4][5] s[4][6] s[5][0] s[5][1] s[5][2] s[5][3] s[5][4] s[5][5] s[5][6] s[6][0] s[6][1] s[6][2] s[6][3] s[6][4] s[6][5] s[6][6] e[0] e[1] e[2] e[3] e[4] e[5] e[6] d[0][0] d[0][1] d[0][2] d[0][3] d[0][4] d[0][5] d[0][6] d[1][0] d[1][1] d[1][2] d[1][3] d[1][4] d[1][5] d[1][6] d[2][0] d[2][1] d[2][2] d[2][3] d[2][4] d[2][5] d[2][6] d[3][0] d[3][1] d[3][2] d[3][3] d[3][4] d[3][5] d[3][6] d[4][0] d[4][1] d[4][2] d[4][3] d[4][4] d[4][5] d[4][6] d[5][0] d[5][1] d[5][2] d[5][3] d[5][4] d[5][5] d[5][6] d[6][0] d[6][1] d[6][2] d[6][3] d[6][4] d[6][5] d[6][6] w[0][0] w[0][1] w[0][2] w[0][3] w[0][4] w[0][5] w[0][6] w[1][0] w[1][1] w[1][2] w[1][3] w[1][4] w[1][5] w[1][6] w[2][0] w[2][1] w[2][2] w[2][3] w[2][4] w[2][5] w[2][6] w[3][0] w[3][1] w[3][2] w[3][3] w[3][4] w[3][5] w[3][6] w[4][0] w[4][1] w[4][2] w[4][3] w[4][4] w[4][5] w[4][6] w[5][0] w[5][1] w[5][2] w[5][3] w[5][4] w[5][5] w[5][6] w[6][0] w[6][1] w[6][2] w[6][3] w[6][4] w[6][5] w[6][6] sd[0][0] sd[0][1] sd[0][2] sd[0][3] sd[0][4] sd[0][5] sd[0][6] sd[1][0] sd[1][1] sd[1][2] sd[1][3] sd[1][4] sd[1][5] sd[1][6] sd[2][0] sd[2][1] sd[2][2] sd[2][3] sd[2][4] sd[2][5] sd[2][6] sd[3][0] sd[3][1] sd[3][2] sd[3][3] sd[3][4] sd[3][5] sd[3][6] sd[4][0] sd[4][1] sd[4][2] sd[4][3] sd[4][4] sd[4][5] sd[4][6] sd[5][0] sd[5][1] sd[5][2] sd[5][3] sd[5][4] sd[5][5] sd[5][6] sd[6][0] sd[6][1] sd[6][2] sd[6][3] sd[6][4] sd[6][5] sd[6][6] </list> <values> 0 94 161 215 262 336 410 0 65 143 209 275 394 408 0 132 225 240 339 366 422 0 42 132 152 221 271 366 0 68 147 240 253 347 407 0 65 161 209 271 305 394 0 64 126 212 313 330 422 453 455 428 458 458 457 453 32 67 31 32 71 72 43 41 35 66 60 72 13 47 94 46 15 73 23 44 6 42 90 20 69 50 95 92 68 75 93 13 86 37 51 65 82 47 62 27 89 63 64 62 86 93 17 92 31 0 1 6 2 4 5 3 4 2 3 6 1 0 5 1 0 4 5 2 3 6 5 0 6 4 1 3 2 6 3 5 4 2 1 0 2 5 1 3 6 0 4 3 4 2 0 5 6 1 0 94 215 410 262 336 161 394 275 65 143 0 408 209 132 0 339 366 225 240 422 42 221 366 271 152 0 132 407 347 253 68 240 147 0 305 161 0 209 394 65 271 212 422 126 0 64 313 330 </values> </instantiation>