| Name | Scheduling/Scheduling-os-taillard/ Taillard-os-05-05-9.xml |
| MD5SUM | b1b903d633c720775ef1eb29649a113f |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 326 |
| Best CPU time to get the best result obtained on this benchmark | 36.6984 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 105 |
| Number of constraints | 90 |
| Number of domains | 7 |
| Minimum domain size | 5 |
| Maximum domain size | 426 |
| Distribution of domain sizes | [{"size":5,"count":50},{"size":426,"count":55}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 6 |
| Distribution of variable degrees | [{"degree":2,"count":30},{"degree":3,"count":50},{"degree":6,"count":25}] |
| Minimum constraint arity | 1 |
| Maximum constraint arity | 7 |
| Distribution of constraint arities | [{"arity":1,"count":5},{"arity":2,"count":25},{"arity":3,"count":25},{"arity":5,"count":10},{"arity":7,"count":25}] |
| Number of extensional constraints | 25 |
| Number of intensional constraints | 30 |
| Distribution of constraint types | [{"type":"extension","count":25},{"type":"intension","count":30},{"type":"allDifferent","count":5},{"type":"noOverlap","count":5},{"type":"element","count":25}] |
| 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: 326<instantiation> <list> e[] w[][] s[][] d[][] sd[][] </list> <values> 326 324 310 326 323 0 4 1 2 3 1 4 2 3 0 2 1 3 4 0 3 0 4 1 2 4 2 3 0 1 0 94 153 189 309 0 56 96 210 310 1 56 166 211 251 0 90 168 200 276 1 55 81 158 249 90 59 36 87 17 56 32 93 99 14 45 97 44 40 59 81 67 30 49 50 53 25 76 91 74 0 153 189 309 94 310 0 96 210 56 251 56 1 166 211 90 200 276 0 168 158 249 55 81 1 </values> </instantiation>