In the max-min ki-partitioning problem, the task is to assign a set of jobs with positive integer processing times to a set of parallel machines – each having an associated machine-dependent cardinality limit ki on the maximal number of jobs that can be processed by machine i – so that the minimum machine completion time is maximized without exceeding the cardinality limits.

Download of problem instances: