| Name | Scheduling/Scheduling-os-taillard/ Taillard-os-05-05-3.xml |
| MD5SUM | 486402128da484f7cb4aeca2fb99213d |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 310 |
| Best CPU time to get the best result obtained on this benchmark | 32.7447 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 105 |
| Number of constraints | 90 |
| Number of domains | 7 |
| Minimum domain size | 5 |
| Maximum domain size | 410 |
| Distribution of domain sizes | [{"size":5,"count":50},{"size":410,"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: 310<instantiation> <list> s[][] d[][] e[] sd[][] w[][] </list> <values> 8 48 129 213 244 0 44 115 193 244 1 6 81 176 229 1 91 136 200 229 0 81 93 176 217 35 45 64 31 66 44 71 78 36 66 5 75 91 53 81 79 38 60 25 77 81 12 83 37 93 310 310 310 306 310 244 48 129 213 8 115 0 193 244 44 6 176 229 81 1 200 229 91 1 136 81 93 0 176 217 4 1 2 3 0 1 4 0 2 3 4 0 3 1 2 3 2 4 0 1 2 0 1 3 4 </values> </instantiation>