List scheduling for jobs with arbitrary release times and similar lengths

Authors:
Rongheng Li;Huei-Chuen Huang
Affiliations:
Department of Mathematics, Hunan Normal University, Changsha, China 410081;Department of Industrial and Systems Engineering, National University of Singapore, Singapore, Singapore 117576
Venue:
Journal of Scheduling
Year:
2007

Citing 9
Cited 7

Bounds for nonpreemptive scheduling of jobs with similar processing times on multiprocessor systems using the LPT-algorithm

Computing
Semi on-line scheduling on two identical machines

Computing
On-line bin-stretching

Theoretical Computer Science
On-line Scheduling for Jobs with Arbitrary Release Times

Computing
Semi-online algorithms for parallel machine scheduling problems

Computing
Semi on-line algorithms for the partition problem

Operations Research Letters
Ordinal algorithms for parallel machine scheduling

Operations Research Letters
Semi-online scheduling with decreasing job sizes

Operations Research Letters
Semi-on-line problems on two identical machines with combined partial information

Operations Research Letters

A Note on Online Scheduling for Jobs with Arbitrary Release Times

COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
Towards Energy Aware Scheduling for Precedence Constrained Parallel Tasks in a Cluster with DVFS

CCGRID '10 Proceedings of the 2010 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing
Resource management of distributed virtual machines

International Journal of Ad Hoc and Ubiquitous Computing
DVFS-control techniques for dense linear algebra operations on multi-core processors

Computer Science - Research and Development
Energy-aware parallel task scheduling in a cluster

Future Generation Computer Systems
Energy-efficient execution of dense linear algebra algorithms on multi-core processors

Cluster Computing
Semi-online scheduling for jobs with release times

Journal of Combinatorial Optimization

Quantified Score

Hi-index	0.00

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 and length in [1,r] with r驴1 on m parallel identical machines. For the list scheduling algorithm, we give an upper bound of the competitive ratio for any m驴1 and show that the upper bound is tight when m=1. When m=2, we present a tight bound for r驴4. For r