A class of on-line scheduling algorithms to minimize total completion time

Authors:
X. Lu;R. A. Sitters;L. Stougie
Affiliations:
Department of Mathematics, Technische Universiteit Eindhoven, P.O.Box 513, 5600 MB Eindhoven, The Netherlands and East China University of Science and Technology, Shanghai 200237, China;Department of Mathematics, Technische Universiteit Eindhoven, P.O.Box 513, 5600 MB Eindhoven, The Netherlands;Department of Mathematics, Technische Universiteit Eindhoven, P.O.Box 513, 5600 MB Eindhoven, The Netherlands and CWI, P.O. Box 94079, 1090GB Amsterdam, The Netherlands
Venue:
Operations Research Letters
Year:
2003

Citing 5
Cited 12

Minimizing mean flow time with release time constraint

Theoretical Computer Science
Approximation Techniques for Average Completion Time Scheduling

SIAM Journal on Computing
Optimal On-Line Algorithms for Single-Machine Scheduling

Proceedings of the 5th International IPCO Conference on Integer Programming and Combinatorial Optimization
On-line Scheduling

Developments from a June 1996 seminar on Online algorithms: the state of the art
Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science

Job scheduling methods for reducing waiting time variance

Computers and Operations Research
On-line scheduling of parallel machines to minimize total completion times

Computers and Operations Research
Optimally competitive list batching

Theoretical Computer Science
Online scheduling on m uniform machines to minimize total (weighted) completion time

Theoretical Computer Science
Online scheduling to minimize modified total tardiness with an availability constraint

Theoretical Computer Science
SRPT is 1.86-competitive for completion time scheduling

SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Real-time scheduling on heterogeneous system-on-chip architectures using an optimised artificial neural network

Journal of Systems Architecture: the EUROMICRO Journal
A note on "An optimal online algorithm for single machine scheduling to minimize total general completion time"

Information Processing Letters
An optimal online algorithm for single machine scheduling to minimize total general completion time

Journal of Combinatorial Optimization
Efficient algorithms for average completion time scheduling

IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
Optimal algorithms for online single machine scheduling with deteriorating jobs

Theoretical Computer Science
On-line scheduling to minimize average completion time revisited

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of scheduling jobs on-line on a single machine and on identical machines with the objective to minimize total completion time. We assume that the jobs arrive over time. We give a general 2-competitive algorithm for the single machine problem. The algorithm is based on delaying the release time of the jobs, i.e., making the jobs artificially later available to the on-line scheduler than the actual release times. Our algorithm includes two known algorithms for this problem that apply delay of release times. The proposed algorithm is interesting since it gives the on-line scheduler a whole range of choices for the delays, each of which leading to 2-competitiveness. We also show that the algorithm is 2@a competitive for the problem on identical machines where @a is the performance ratio of the Shortest Remaining Processing Time first rule for the preemptive relaxation of the problem.