A Note on Online Scheduling for Jobs with Arbitrary Release Times

Authors:
Jihuan Ding;Guochuan Zhang
Affiliations:
College of Operations Research and Management Science, Qufu Normal University, Rizhao, China 276826 and College of Computer Science, Zhejiang University, Hangzhou, China 310027;College of Computer Science, Zhejiang University, Hangzhou, China 310027
Venue:
COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
Year:
2009

Citing 2
Cited 1

On-line Scheduling for Jobs with Arbitrary Release Times

Computing
List scheduling for jobs with arbitrary release times and similar lengths

Journal of Scheduling

Load Balancing Query Processing in Metric-Space Similarity Search

CCGRID '12 Proceedings of the 2012 12th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (ccgrid 2012)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate the problem of on-line scheduling for jobs with arbitrary release times on m identical parallel machines. The goal is to minimize the makespan. We derive a best possible online algorithm with competitive ratio of 2 for m = 2. For a special case that all the jobs have unit processing times, we prove that Algorithm LS has a tight bound of 3/2 for general m machines.