An optimal online algorithm for scheduling two machines with release times

Theoretical Computer Science

Volumn 268, Issue 1, 2001, Pages 133-143

  Noga, John ^a   Seiden, Steven S ^b  

^a GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

^b Louisiana State University   (United States)

Author keywords

Competitive online algorithms; Lower bounds; Scheduling

Indexed keywords

ALGORITHMS; ONLINE SYSTEMS; SCHEDULING;

LOWER BOUNDS;

COMPUTER SCIENCE;

EID: 0035818335     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(00)00264-4     Document Type: Conference Paper

References (23)

1. Better bounds for online scheduling
2. New algorithms for an ancient scheduling problem
3. A better lower bound for on-line scheduling
4. A lower bound for randomized on-line scheduling algorithms
5. New lower and upper bounds for on-line scheduling
6. Scheduling on identical machines. How good is LPT in an online setting?
7. On the performance of on-line algorithms for partition problems
8. An online scheduling heuristic with better worst case ratio than Graham's list scheduling
9. Bounds for certain multiprocessing anomalies
10. Approximation schemes for constrained scheduling problems
11. A better algorithm for an ancient scheduling problem
12. Competitive snoopy caching
13. Sequencing and scheduling: Algorithms and complexity
14. Randomized competitive algorithms for the list update problem
15. Randomized algorithms for that ancient scheduling problem
16. A lower bound for randomized on-line multiprocessor scheduling
17. Scheduling parallel machines on-line
18. Amortized efficiency of list update and paging rules
19. Randomized on-line scheduling: How low can't you go?
20. Probabilistic computations: Toward a unified measure of complexity