A computing cluster has n processors and m > n tasks to be run, each on a single processor. Each

task j M = {1, 2 . . . , m} requires tj hours to complete (tj is an integer parameter), and when

a task is spawned on a processor i N = {1, 2 . . . , n}, that processor only runs task j until its

completion.

Formulate a model for loading the tasks onto the processors in such a way that the whole cluster

becomes totally free again as soon as possible, that is, we want to minimize the time of completion

of all tasks given that all of them are executed.