I have a scenario, in which I have
m independent jobs to be schedule on
n workers parallely. Time required by each of these jobs is known. The problem is how to distribute these
m independent jobs such that the total run time of completion of all the
m jobs by the
n workers is minimum.
One ad-hoc greedy approach I can think of is to sort the jobs by their run time and assign the jobs to workers such that each of them have almost similar run time for job completion.Is there a better approach? Thanks