Online scheduling of equal-processing-time task systems

Document Type

Article

Publication Date

7-23-2008

Abstract

We consider the problem of online scheduling a set of equal-processing-time tasks with precedence constraints so as to minimize the makespan. For arbitrary precedence constraints, it is known that any list scheduling algorithm has a competitive ratio of 2 - 1 / m, where m is the number of machines. We show that for intree precedence constraints, Hu's algorithm yields an asymptotic competitive ratio of 3/2. © 2008 Elsevier B.V. All rights reserved.

Identifier

45049087046 (Scopus)

Publication Title

Theoretical Computer Science

External Full Text Location

https://doi.org/10.1016/j.tcs.2008.03.026

ISSN

03043975

First Page

85

Last Page

95

Issue

1-3

Volume

401

Grant

DMI-0556010

Fund Ref

National Science Foundation

This document is currently not available here.

Share

COinS