Special Cases of Online Parallel Job Scheduling

In this paper we consider the online scheduling of jobs, which require processing on a number of machines simultaneously. These jobs are presented to a decision maker one by one, where the next job becomes known as soon as the current job is scheduled. The objective is to minimize the makespan. For the problem with three machines we give a 2.8-competitive algorithm, improving upon the 3-competitive greedy algorithm. For the special case with arbitrary number of machines, where the jobs appear in non-increasing order of machine requirement, we give a 2.4815-competitive algorithm, improving the 2.75-competitive greedy algorithm.

• Type: Conference
• Year: 2008
• Where: COLOGNETWENTE
• Authors: Johann Hurink, Jacob Jan Paulus
• Keywords: 3-competitive Greedy Algorithm, COLOGNETWENTE 2008, Greedy Algorithm, Machine, Optimization