Algorithms for total weighted completion time scheduling

Authors:
Ivan D. Baev;Waleed M. Meleis;Alexandre E. Eichenberger
Affiliations:
Department of ECE, Northeastern University, Boston, MA;Department of ECE, Northeastern University, Boston, MA;Department of ECE, NC State University, EGRC, Box 7914, Raleigh, NC
Venue:
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Year:
1999

Citing 1
Cited 5

An experimental study of LP-based approximation algorithms for scheduling problems

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms

Balance scheduling: weighting branch tradeoffs in superblocks

Proceedings of the 32nd annual ACM/IEEE international symposium on Microarchitecture
Lower bounds on precedence-constrained scheduling for parallel processors

Information Processing Letters
Lower Bounds on Precedence-Constrained Scheduling for Parallel Processors

ICPP '00 Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing
Heuristic scheduling algorithms designed based on properties of optimal algorithm for soft real-time tasks

Proceedings of the 2007 Summer Computer Simulation Conference
On-line scheduling of real-time services with profit and penalty

Proceedings of the 2011 ACM Symposium on Applied Computing

Quantified Score

Hi-index	0.01

Visualization

Abstract