| Name | Scheduling/Scheduling-os-taillard/ Taillard-os-05-05-1.xml |
| MD5SUM | 3747a76ad44ca32161ac6cfee5e9d7cb |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 262 |
| Best CPU time to get the best result obtained on this benchmark | 28.3402 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 105 |
| Number of constraints | 90 |
| Number of domains | 7 |
| Minimum domain size | 4 |
| Maximum domain size | 362 |
| Distribution of domain sizes | [{"size":4,"count":5},{"size":5,"count":45},{"size":362,"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: 262<instantiation> <list> w[][] s[][] d[][] e[] sd[][] </list> <values> 1 2 0 3 4 4 3 0 2 1 0 1 4 2 3 2 0 4 1 3 3 1 4 2 0 2 40 128 147 230 4 56 162 176 240 29 70 157 240 261 0 40 120 153 240 0 55 70 121 176 38 81 19 83 32 52 90 6 64 22 8 83 35 15 1 40 71 33 87 21 55 15 42 55 86 262 262 262 261 262 128 2 40 147 230 162 240 176 56 4 29 70 240 261 157 40 153 0 240 120 176 55 121 0 70 </values> </instantiation>