I think this should be a famous problem but I could not find its name.
I have $n$ jobs with size $s_i$ that are offered at time $t_i$ and $k$ machines. How can I assign jobs to machines to minimize the maximum finish time.
I know that when the offering times $t_i$s are equal, this is a partition problem as it balances the jobs over machines. Also I know that there are approximation algorithms for that.
Is there any greedy algorithm (with approximation bound) for this generalized version?