| Name | Scheduling/Scheduling-js-taillard/ Taillard-js-030-15-2.xml |
| MD5SUM | ba573a75edcb56a5f29535772f8b277a |
| 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 | 480 |
| Number of constraints | 495 |
| Number of domains | 1 |
| Minimum domain size | 1932 |
| Maximum domain size | 1932 |
| Distribution of domain sizes | [{"size":1932,"count":480}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 3 |
| Distribution of variable degrees | [{"degree":2,"count":30},{"degree":3,"count":450}] |
| Minimum constraint arity | 1 |
| Maximum constraint arity | 30 |
| Distribution of constraint arities | [{"arity":1,"count":30},{"arity":2,"count":450},{"arity":30,"count":15}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 480 |
| Distribution of constraint types | [{"type":"intension","count":480},{"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: