In the maxmin kipartitioning 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 machinedependent 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:
References:

Lawrinenko, A.; Schwerdfeger, S.; Walter, R. (2017): Reduction criteria, upper bounds, and a dynamic programming based heuristic for the maxmin k_ipartitioning problem. Journal of Heuristics (online first, doi=10.1007/s1073201793629).