On-line Scheduling for Jobs with Arbitrary Release Times

Authors:
R. Li;H.-C. Huang
Affiliations:
National University Of Singapore, Department of Industrial and Systems Engineering, 1 Engineering Drive 2, Singapore;National University Of Singapore, Department of Industrial and Systems Engineering, 1 Engineering Drive 2, 117576, Singapore
Venue:
Computing
Year:
2004

Citing 6
Cited 6

New algorithms for an ancient scheduling problem

STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
An on-line scheduling heuristic with better worst case ratio than Graham's list scheduling

SIAM Journal on Computing
Nonclairvoyant scheduling

Theoretical Computer Science - Special issue on dynamic and on-line algorithms
Scheduling Parallel Machines On-line

SIAM Journal on Computing
Semi on-line scheduling on two identical machines

Computing
Scheduling on identical machines: How good is LPT in an on-line setting?

Operations Research Letters

List scheduling for jobs with arbitrary release times and similar lengths

Journal of Scheduling
Online bin packing with arbitrary release times

Theoretical Computer Science
Worst Case Behavior of List Algorithms for Dynamic Scheduling of Non-unit Execution Time Tasks with Arbitrary Precedence Constrains

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
A Note on Online Scheduling for Jobs with Arbitrary Release Times

COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
On-line bin packing with arbitrary release times

ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
Semi-online scheduling for jobs with release times

Journal of Combinatorial Optimization

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper considers the problem of on-line scheduling a list of independent jobs in which each job has an arbitrary release time on m parallel identical machines. A tight bound is given for List Scheduling(LS) algorithm and a better algorithm is given for m≥2.