Scheduling precedence-constrained jobs with stochastic processing times on parallel machines

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2001, Pages 589-590

  Skutella, Martin ^a   Uetz, Marc ^a  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

Algorithms; Theory; Verification

Indexed keywords

EID: 0011464430     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (3)

1. C. Chekuri , R. Motwani , B. Natarajan , C. Stein, Approximation Techniques for Average Completion Time Scheduling, SIAM Journal on Computing, v.31 n.1, p.146-166, 2001 [doi〉10.1137/S0097539797327180]
2. R. H. Mhhring, F. J. Radermacher, and G. Weiss, Stochastic scheduling problems I: General strategies, ZOR - Zeitschrift ffir Oper. Res. 28 (1984), 193-260.
3. Rolf H. Möhring , Andreas S. Schulz , Marc Uetz, Approximation in stochastic scheduling: the power of LP-based priority policies, Journal of the ACM (JACM), v.46 n.6, p.924-942, Nov. 1999 [doi〉10.1145/331524.331530]