| Name | Scheduling/Scheduling-js-taillard/ Taillard-js-050-15-1.xml |
| MD5SUM | 4cb8aacd6a4a2864e81512910dbfacc0 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | |
| Best value of the objective obtained on this benchmark | |
| Best CPU time to get the best result obtained on this benchmark | |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 800 |
| Number of constraints | 815 |
| Number of domains | 1 |
| Minimum domain size | 2856 |
| Maximum domain size | 2856 |
| Distribution of domain sizes | [{"size":2856,"count":800}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 3 |
| Distribution of variable degrees | [{"degree":2,"count":50},{"degree":3,"count":750}] |
| Minimum constraint arity | 1 |
| Maximum constraint arity | 50 |
| Distribution of constraint arities | [{"arity":1,"count":50},{"arity":2,"count":750},{"arity":50,"count":15}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 800 |
| Distribution of constraint types | [{"type":"intension","count":800},{"type":"noOverlap","count":15}] |
| 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: