Nederlands
Contact
Search
OrganisationEEMCS EPrints Service
 |
|
|
||||||||||||||||||||||||||||||||||||||
|
|
|
|
|
||||||||||||||||||||||||||||||||||||
|
|
|
||||||||||||||||||||||||||||||||||||||
|
|
|
|
|
||||||||||||||||||||||||||||||||||||
|
|
Hurink, J.L. and Paulus, J.J.
(2011)
Improved online algorithms for parallel job scheduling and strip packing.
Theoretical computer science, 412 (7).
pp. 583-593.
ISSN 0304-3975
*** ISI Impact 0,665 ***
Full text available as:
Official URL: http://dx.doi.org/10.1016/j.tcs.2009.05.033  AbstractIn 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_max). 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.
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 |
|
|
||||||||||||||||||||||||||||||||||||
|
|
|
||||||||||||||||||||||||||||||||||||||
|
|
|
|
|
||||||||||||||||||||||||||||||||||||
|
|
|
||||||||||||||||||||||||||||||||||||||
