Approximate algorithms scheduling parallelizable tasks
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Scheduling parallel jobs to minimize the makespan
Journal of Scheduling
On-line scheduling of parallel jobs in a list
Journal of Scheduling
Online scheduling of parallel jobs on two machines is 2-competitive
Operations Research Letters
Online malleable job scheduling for m≤3
Information Processing Letters
SIGACT news online algorithms column 20: the power of harmony
ACM SIGACT News
The generalization of scheduling with machine cost
Theoretical Computer Science
| Hi-index | 5.23 |
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 (P|online -list,m"j|C"m"a"x). We present a 6.6623-competitive algorithm for this online problem, improving the best known algorithm, which is 7-competitive. The presented algorithm also applies to the online orthogonal strip packing problem. Since the previous results for this problem assume bounded rectangles, the presented algorithm is the first with a constant competitive ratio for the general online orthogonal strip packing problem. Furthermore, for the special case with 3 machines we give a 2.8-competitive algorithm, improving upon the 3-competitive greedy algorithm.