Maximizing the Minimum Machine Load
Years and Authors of Summarized Original Work
1982; Deuermeyer, Friesen, Langston
1998; Azar, Epstein
In a scheduling problem we have to find an optimal schedule of jobs. Here we consider the parallel machines case, where m machines are given, and we can use them to schedule the jobs. In the most fundamental model, each job has a known processing time, and to schedule the job we have to assign it to a machine, and we have to give its starting time and a completion time, where the difference between the completion time and the starting time is the processing time. No machine may simultaneously run two jobs. If no further assumptions are given then the machines can schedule the jobs assigned to them without an idle time and the total time required to schedule the jobs on a machine is the sum of the processing times of the jobs assigned to it. We call this value the load of the machine.
Concerning the machine environment three different models are...
KeywordsScheduling Approximation algorithms Multiprocessor systems