Approximation techniques for average completion time scheduling

Saved in:
Bibliographic Details
Published inSIAM journal on computing Vol. 31; no. 1; pp. 146 - 166
Main Authors CHEKURI, C, MOTWANI, R, NATARAJAN, B, STEIN, C
Format Journal Article
LanguageEnglish
Published Philadelphia, PA Society for Industrial and Applied Mathematics 2001
Subjects
Algorithmics. Computability. Computer arithmetics
Applied sciences
Computer science; control theory; systems
Exact sciences and technology
Operational research and scientific management
Operational research. Management science
Scheduling, sequencing
Theoretical computing
Lower bound
Parallel algorithm
Parallel machines
Beat
Linear programming
Scheduling
Parallel
Approximation algorithm
Mean estimation
Precedence constraint
Weight
Parallel machine
Relaxation
Randomization
Completion
Time average
Experimental design
Ordering
Problem solving
Parallel processing
Tree
Deterministic algorithms
Completion time
Online AccessGet full text

Cover

More Information
ISSN:0097-5397
1095-7111
DOI:10.1137/S0097539797327180