About two months ago I and others posted several algorithms for for n
items distributed among k bins. In those, bin size was constrained by
need to put one in each bin and to fill from large to small. I
believe calculation of max in bin could be augmented by your other
constraint, while '1 in each' constraint could be omitted (or else
rerun algorithm for different values of k).
Terry J. Reedy