| Name | Scheduling/Scheduling-os-taillard/ Taillard-os-05-05-5.xml |
| MD5SUM | 5197a9101df9cd680fadf9dcc86a0dcb |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 312 |
| Best CPU time to get the best result obtained on this benchmark | 30.0924 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 105 |
| Number of constraints | 90 |
| Number of domains | 7 |
| Minimum domain size | 5 |
| Maximum domain size | 412 |
| Distribution of domain sizes | [{"size":5,"count":50},{"size":412,"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: 312<instantiation> <list> d[][] sd[][] e[] w[][] s[][] </list> <values> 5 86 93 41 60 6 4 81 63 96 46 62 50 17 81 61 78 85 26 55 56 37 34 82 98 98 208 252 12 2 216 145 47 3 9 191 78 0 225 140 0 257 225 139 61 61 0 132 98 214 312 312 306 312 312 4 3 0 1 2 3 4 2 1 0 2 1 4 0 3 0 4 3 2 1 1 0 3 2 4 2 12 98 208 252 3 9 47 145 216 0 78 140 191 225 0 61 139 225 257 0 61 98 132 214 </values> </instantiation>