Online scheduling of equal-processing-time task systems

Authors:
Yumei Huo;Joseph Y. -T. Leung;Xin Wang
Affiliations:
Department of Computer Science, CUNY at Staten Island, Staten Island, NY 10314, United States;Department of Computer Science, New Jersey Institute of Technology, Newark, NJ 07102, United States;Department of Computer Science, New Jersey Institute of Technology, Newark, NJ 07102, United States
Venue:
Theoretical Computer Science
Year:
2008

Citing 4
Cited 2

Preemptive Scheduling of Real-Time Tasks on Multiprocessor Systems

Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Online Scheduling of Precedence Constrained Tasks

SIAM Journal on Computing
Optimal Preemptive Scheduling on Two-Processor Systems

IEEE Transactions on Computers

Parallel machine problems with equal processing times: a survey

Journal of Scheduling
A best possible online algorithm for scheduling equal-length jobs on two machines with chain precedence constraints

Theoretical Computer Science

Quantified Score

Hi-index	5.23

Visualization

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.