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
On-Line Multiple-Strip Packing
COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
Theoretical Computer Science
Improved lower bound for online strip packing
WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
On-line scheduling of multi-core processor tasks with virtualization
Operations Research Letters
On-Line scheduling of parallel jobs in heterogeneous multiple clusters
FAW-AAIM'12 Proceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management
A tight analysis of Brown-Baker-Katseff sequences for online strip packing
Journal of Combinatorial Optimization
| Hi-index | 0.00 |
We consider the online scheduling problem of parallel jobs on parallel machines, P|online - list, mj |Cmax. For this problem we present a 6.6623-competitive algorithm. This improves the best known 7- competitive algorithm for this problem. The presented algorithm also applies to the special case where machines are ordered on a line and only adjacent machines can be assigned to a job and, therefore, also to online orthogonal strip packing. Since previous results for online orthogonal strip packing assume bounded rectangles, the presented algorithm is the first with a constant competitive ratio.