Let (m,n,t) be a problem instance, where:
- m is the number of machines
- n is the number of jobs
- tj is the processing duration of a job j
The load balancing problem is a problem about assigning every job to a machine such that the total processing duration (makespan) is minimal.