| Name | Scheduling/Scheduling-js-taillard/ Taillard-js-050-20-7.xml |
| MD5SUM | ecccf1fc77215d60d30343c091882466 |
| 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 | 1050 |
| Number of constraints | 1070 |
| Number of domains | 1 |
| Minimum domain size | 2884 |
| Maximum domain size | 2884 |
| Distribution of domain sizes | [{"size":2884,"count":1050}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 3 |
| Distribution of variable degrees | [{"degree":2,"count":50},{"degree":3,"count":1000}] |
| Minimum constraint arity | 1 |
| Maximum constraint arity | 50 |
| Distribution of constraint arities | [{"arity":1,"count":50},{"arity":2,"count":1000},{"arity":50,"count":20}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 1050 |
| Distribution of constraint types | [{"type":"intension","count":1050},{"type":"noOverlap","count":20}] |
| 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: