| Name | Scheduling/Scheduling-os-taillard/ Taillard-os-05-05-6.xml |
| MD5SUM | f9b69c01e6bb1a0d57b760340d1825ed |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 303 |
| Best CPU time to get the best result obtained on this benchmark | 29.7154 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 105 |
| Number of constraints | 90 |
| Number of domains | 7 |
| Minimum domain size | 4 |
| Maximum domain size | 405 |
| Distribution of domain sizes | [{"size":4,"count":5},{"size":5,"count":45},{"size":405,"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: 303<instantiation> <list> d[][] sd[][] e[] w[][] s[][] </list> <values> 62 16 65 65 51 58 71 31 85 49 2 47 63 78 62 14 97 95 48 42 80 9 7 76 89 149 252 0 84 68 61 132 254 168 3 14 163 64 2 241 0 14 206 255 111 214 120 127 4 84 303 303 303 297 303 2 4 3 0 1 4 0 1 3 2 3 0 2 1 4 0 1 4 2 3 3 4 1 2 0 0 68 84 149 252 3 61 132 168 254 2 14 64 163 241 0 14 111 206 255 4 84 120 127 214 </values> </instantiation>