EEMCS EPrints Service
Hurink, J.L. and Paulus, J.J. (2008) Online algorithm for parallel job scheduling and strip packing. In: 5th International Workshop on Approximation and Online Algorithms, WAOA 2007, 11-12 Oct, 2007, Eilat, Israel. pp. 67-74. Lecture Notes in Computer Science 4927. Springer Verlag. ISSN 0302-9743 ISBN 978-3-540-77917-9
This is the latest version of this eprint.
Full text available as:
Official URL: http://dx.doi.org/10.1007/978-3-540-77918-6_6
We consider the online scheduling problem of parallel jobs on parallel machines, . 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.
Available Versions of this Item
Export this item as:
To request a copy of the PDF please email us request copy
To correct this item please ask your editor
Repository Staff Only: edit this item