A note on "An On-line scheduling heuristic with better worst case ratio than graham's list scheduling"

SIAM Journal on Computing

Volumn 26, Issue 3, 1997, Pages 870-872

  Chandrasekaran, R ^a   Chen, B O ^b   Galambos, Gábor ^c   Narayanan, P R ^a   Van Vliet, André ^d   Woeginger, Gerhard J ^e  

^a UNIVERSITY OF TEXAS AT DALLAS   (United States)

^b UNIVERSITY OF WARWICK   (United Kingdom)

^c UNIVERSITY OF SZEGED   (Hungary)

^d ORTEC The Netherlands   (Netherlands)

^e GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

Combinatorial problems; On line algorithms; Scheduling; Worst case bounds

Indexed keywords

EID: 0345937052     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539793258775     Document Type: Article

References (3)

1. B. CHEN AND A. VAN VLIET, On the on-line scheduling algorithm RLS, Report 9325/A, Econometric Institute, Erasmus University, Rotterdam, The Netherlands, 1993.
2. G. GALAMBOS AND G. J. WOEGINGER, An on-line scheduling heuristic with better worst case ratio than Graham's list scheduling, SIAM J. Comput., 22 (1993), pp. 349-355.
3. P. R. NARAYANAN, Performance analysis of on-line algorithms under various scheduling criteria, Ph.D. thesis, University of Texas at Dallas, Dallas, TX, 1992.