| Name | Scheduling/Scheduling-os-taillard/ Taillard-os-05-05-0.xml |
| MD5SUM | da64694dd3ca715594c36c32a8b555a8 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 300 |
| Best CPU time to get the best result obtained on this benchmark | 25.2154 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 105 |
| Number of constraints | 90 |
| Number of domains | 7 |
| Minimum domain size | 5 |
| Maximum domain size | 400 |
| Distribution of domain sizes | [{"size":5,"count":50},{"size":400,"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: 300<instantiation> <list> s[][] d[][] sd[][] e[] w[][] </list> <values> 0 67 131 175 267 15 61 186 276 291 0 1 66 136 210 0 13 81 157 255 3 37 129 141 211 66 64 44 85 31 18 68 69 14 7 1 60 70 74 90 13 54 76 98 45 15 91 10 45 80 67 0 267 175 131 291 186 61 276 15 136 66 1 0 210 13 255 157 81 0 211 141 129 3 37 298 298 300 300 291 1 0 4 3 2 4 2 1 3 0 3 2 1 0 4 4 0 3 2 1 3 4 2 1 0 </values> </instantiation>