| Name | Scheduling/Scheduling-os-taillard/ Taillard-os-04-04-6.xml |
| MD5SUM | 823116dec5fc747e102c8991d04b98a3 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 201 |
| Best CPU time to get the best result obtained on this benchmark | 0.45434499 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 68 |
| Number of constraints | 60 |
| Number of domains | 6 |
| Minimum domain size | 4 |
| Maximum domain size | 301 |
| Distribution of domain sizes | [{"size":4,"count":32},{"size":301,"count":36}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 5 |
| Distribution of variable degrees | [{"degree":2,"count":20},{"degree":3,"count":32},{"degree":5,"count":16}] |
| Minimum constraint arity | 1 |
| Maximum constraint arity | 6 |
| Distribution of constraint arities | [{"arity":1,"count":4},{"arity":2,"count":16},{"arity":3,"count":16},{"arity":4,"count":8},{"arity":6,"count":16}] |
| Number of extensional constraints | 16 |
| Number of intensional constraints | 20 |
| Distribution of constraint types | [{"type":"extension","count":16},{"type":"intension","count":20},{"type":"allDifferent","count":4},{"type":"noOverlap","count":4},{"type":"element","count":16}] |
| 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: 201<instantiation type="optimum" cost="201"> <list> s[0][0] s[0][1] s[0][2] s[0][3] s[1][0] s[1][1] s[1][2] s[1][3] s[2][0] s[2][1] s[2][2] s[2][3] s[3][0] s[3][1] s[3][2] s[3][3] e[0] e[1] e[2] e[3] d[0][0] d[0][1] d[0][2] d[0][3] d[1][0] d[1][1] d[1][2] d[1][3] d[2][0] d[2][1] d[2][2] d[2][3] d[3][0] d[3][1] d[3][2] d[3][3] w[0][0] w[0][1] w[0][2] w[0][3] w[1][0] w[1][1] w[1][2] w[1][3] w[2][0] w[2][1] w[2][2] w[2][3] w[3][0] w[3][1] w[3][2] w[3][3] sd[0][0] sd[0][1] sd[0][2] sd[0][3] sd[1][0] sd[1][1] sd[1][2] sd[1][3] sd[2][0] sd[2][1] sd[2][2] sd[2][3] sd[3][0] sd[3][1] sd[3][2] sd[3][3] </list> <values> 0 9 61 144 0 30 73 151 5 61 73 151 0 9 71 137 201 191 170 201 9 17 83 57 30 43 78 40 56 8 57 19 5 62 66 64 2 1 3 0 0 1 2 3 3 0 1 2 3 2 0 1 144 9 0 61 0 30 73 151 61 73 151 5 71 137 9 0 </values> </instantiation>