On-line scheduling to minimize average completion time revisited

Authors:
Nicole Megow;Andreas S Schulz
Affiliations:
Institut für Mathematik, Technische Universität Berlin, Sekr. MA 6-1, Strasse des 17. Juni 136, Berlin 10623, Germany;Sloan School of Management, Massachusetts Institute of Technology, Office E53-361, 77 Massachusetts Avenue, Cambridge, MA 02139-4307, USA
Venue:
Operations Research Letters
Year:
2004

Citing 9
Cited 17

Amortized efficiency of list update and paging rules

Communications of the ACM
Scheduling to minimize average completion time: off-line and on-line approximation algorithms

Mathematics of Operations Research
On-line scheduling of a single machine to minimize total weighted completion time

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Approximation Techniques for Average Completion Time Scheduling

SIAM Journal on Computing
Scheduling Unrelated Machines by Randomized Rounding

SIAM Journal on Discrete Mathematics
Single Machine Scheduling with Release Dates

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

Proceedings of the 5th International IPCO Conference on Integer Programming and Combinatorial Optimization
Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
A class of on-line scheduling algorithms to minimize total completion time

Operations Research Letters

Models and Algorithms for Stochastic Online Scheduling

Mathematics of Operations Research
Approximation in preemptive stochastic online scheduling

ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
The Power of Preemption in Economic Online Markets

GECON '08 Proceedings of the 5th international workshop on Grid Economics and Business Models
On-line scheduling of parallel machines to minimize total completion times

Computers and Operations Research
Online scheduling of pick-up and delivery tasks in hospitals

Journal of Biomedical Informatics
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
A priori parallel machines scheduling

Computers and Industrial Engineering
Mechanism Design for Decentralized Online Machine Scheduling

Operations Research
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
Decentralization and mechanism design for online machine scheduling

SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
LP-based online scheduling: from single to parallel machines

IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
Stochastic online scheduling on parallel machines

WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
Efficient algorithms for average completion time scheduling

IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
Completion time scheduling and the WSRPT algorithm

ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
A better online algorithm for the parallel machine scheduling to minimize the total weighted completion time

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the scheduling problem of minimizing the average-weighted completion time on identical parallel machines when jobs are arriving over time. For both the preemptive and the nonpreemptive setting, we show that straightforward extensions of Smith's ratio rule yield smaller competitive ratios than the previously best-known deterministic on-line algorithms.