A new average case analysis for completion time scheduling

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2002, Pages 170-178

  Scharbrodt, Mark ^a   Schickinger, Thomas ^a   Steger, Angelika ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; PROBABILITY DISTRIBUTIONS; RANDOM PROCESSES; SCHEDULING;

AVERAGE CASE ANALYSIS; COMPETITIVE ANALYSIS; COMPLETION TIME ANALYSIS;

COMPUTATIONAL COMPLEXITY;

EID: 0036038480     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/509935.509936     Document Type: Conference Paper

References (19)

1. Expected relative performance of list scheduling rules
2. A stochastic model of bin-packing
3. Scheduling tasks with exponential service times on parallel machines
4. Optimization and approximation in deterministic sequencing and scheduling: A survey
5. On the optimality of static priority policies in stochastic scheduling on parallel machines
6. Probabilistic analysis of some bin-packing algorithms
7. Stochastic scheduling with variable profile and precedence constraints
8. Scheduling with deadlines and loss functions
9. Introduction to stochastic scheduling problems
10. Stochastic scheduling problems I: General strategies
11. Stochastic scheduling problems II: General strategies
12. Approximation in stochastic scheduling: The power of LP-based priority policies
13. On stochastic scheduling with in-tree precendence constraints
14. Scheduling with random service times
15. Various optimizers for single-stage production
16. Scheduling jobs with stochastically ordered processing times on parallel machines to minimize expected flowtime
17. Scheduling tasks with exponential service times on non-identical processors to minimize various cost functions