| Name | Scheduling/Scheduling-os-taillard/ Taillard-os-05-05-4.xml |
| MD5SUM | a08c622730be04b0ce65f9055d76b754 |
| 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 | 26.2689 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 105 |
| Number of constraints | 90 |
| Number of domains | 7 |
| Minimum domain size | 5 |
| Maximum domain size | 429 |
| Distribution of domain sizes | [{"size":5,"count":50},{"size":429,"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> sd[][] d[][] e[] w[][] s[][] </list> <values> 215 274 137 77 4 291 151 91 24 199 1 92 215 151 295 120 2 296 220 291 92 199 0 277 120 73 60 78 58 52 52 46 48 92 33 86 59 63 80 31 85 92 56 2 5 91 28 78 75 49 326 324 326 301 326 4 3 2 0 1 3 2 1 4 0 0 1 3 2 4 1 0 3 4 2 2 0 4 1 3 4 77 137 215 274 24 91 151 199 291 1 92 151 215 295 2 120 220 291 296 0 92 120 199 277 </values> </instantiation>