| 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.4046 |
| 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> e[] w[][] s[][] sd[][] d[][] </list> <values> 302 301 289 303 303 1 4 0 3 2 2 3 1 0 4 4 1 3 2 0 3 2 4 1 0 0 2 1 4 3 5 62 93 158 240 0 50 140 171 243 0 62 156 175 242 7 49 97 192 289 2 97 177 200 223 93 5 240 158 62 171 140 0 50 243 242 62 175 156 0 289 192 49 7 97 2 177 97 223 200 51 16 65 65 62 49 85 31 71 58 62 78 2 63 47 42 48 95 97 14 89 76 7 9 80 </values> </instantiation>