Name | Scheduling/Scheduling-fs-taillard/ Taillard-fs-050-05-1.xml |
MD5SUM | 3ac1b524e32e52d6c8adbfb753c77199 |
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 | 300 |
Number of constraints | 305 |
Number of domains | 1 |
Minimum domain size | 2934 |
Maximum domain size | 2934 |
Distribution of domain sizes | [{"size":2934,"count":300}] |
Minimum variable degree | 2 |
Maximum variable degree | 3 |
Distribution of variable degrees | [{"degree":2,"count":50},{"degree":3,"count":250}] |
Minimum constraint arity | 1 |
Maximum constraint arity | 50 |
Distribution of constraint arities | [{"arity":1,"count":50},{"arity":2,"count":250},{"arity":50,"count":5}] |
Number of extensional constraints | 0 |
Number of intensional constraints | 300 |
Distribution of constraint types | [{"type":"intension","count":300},{"type":"noOverlap","count":5}] |
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: