| Name | Scheduling/Scheduling-os-taillard/ Taillard-os-05-05-8.xml |
| MD5SUM | 43b2ef46cc27b455a3f22cfd7dbefeca |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 353 |
| Best CPU time to get the best result obtained on this benchmark | 27.4421 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 105 |
| Number of constraints | 90 |
| Number of domains | 7 |
| Minimum domain size | 5 |
| Maximum domain size | 453 |
| Distribution of domain sizes | [{"size":5,"count":50},{"size":453,"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: 353<instantiation> <list> e[] w[][] s[][] sd[][] d[][] </list> <values> 353 353 353 353 352 3 0 1 2 4 0 3 2 4 1 1 2 4 0 3 2 1 4 3 0 4 3 0 1 2 17 73 132 180 263 0 73 96 191 260 1 56 90 171 259 0 56 131 190 257 0 102 151 167 263 73 132 180 17 263 0 260 96 73 191 171 1 56 259 90 257 56 0 190 131 151 167 263 102 0 38 22 35 83 90 73 23 84 68 93 38 34 41 77 94 55 72 59 67 96 90 49 16 93 89 </values> </instantiation>