Name | Scheduling/Scheduling-os-taillard/ Taillard-os-20-20-9.xml |
MD5SUM | 167976addb93ebd5943ef7570ccdd100 |
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 | 1620 |
Number of constraints | 1260 |
Number of domains | 22 |
Minimum domain size | 15 |
Maximum domain size | 1384 |
Distribution of domain sizes | [{"size":15,"count":40},{"size":17,"count":40},{"size":18,"count":140},{"size":19,"count":180},{"size":20,"count":400},{"size":1384,"count":820}] |
Minimum variable degree | 2 |
Maximum variable degree | 21 |
Distribution of variable degrees | [{"degree":2,"count":420},{"degree":3,"count":800},{"degree":21,"count":400}] |
Minimum constraint arity | 1 |
Maximum constraint arity | 22 |
Distribution of constraint arities | [{"arity":1,"count":20},{"arity":2,"count":400},{"arity":3,"count":400},{"arity":20,"count":40},{"arity":22,"count":400}] |
Number of extensional constraints | 400 |
Number of intensional constraints | 420 |
Distribution of constraint types | [{"type":"extension","count":400},{"type":"intension","count":420},{"type":"allDifferent","count":20},{"type":"noOverlap","count":20},{"type":"element","count":400}] |
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: