|
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.
.
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:  | PDF - Univ. of Twente only 452 Kb |
Official URL: http://dx.doi.org/10.1007/978-3-540-77918-6_6  AbstractWe 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. | Item Type: | Conference or Workshop Paper (Full Paper, Talk) |
|---|
| Research Group: | EWI-DMMP: Discrete Mathematics and Mathematical Programming |
|---|
| Research Program: | CTIT-IE&ICT: Industrial Engineering and ICT |
|---|
| Research Project: | BRICKS/IS3: Decision Support Systems for Logistic Networks and Supply Chain Optimization |
|---|
| ID Code: | 12000 |
|---|
| Status: | Published |
|---|
| Deposited On: | 13 February 2008 |
|---|
| Refereed: | Yes |
|---|
| International: | Yes |
|---|
| More Information: | statisticsmetis |
|---|
Available Versions of this ItemExport 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
|