How much can lookahead help in online single machine scheduling

Information Processing Letters

Volumn 106, Issue 2, 2008, Pages 70-74

  Zheng, Feifeng ^a   Xu, Yinfeng ^a,b   Zhang, E ^c  

^a XI'AN JIAOTONG UNIVERSITY   (China)

^b XI'AN JIAOTONG UNIVERSITY   (China)

^c SHANGHAI UNIVERSITY OF FINANCE AND ECONOMICS   (China)

Author keywords

Lookahead; Online strategies; Scheduling

Indexed keywords

JOB ANALYSIS; MATHEMATICAL MODELS; OPTIMIZATION; SCHEDULING;

LOOKAHEAD; ONLINE STRATEGIES; PREEMPTION-RESTART MODELS;

ONLINE SYSTEMS;

EID: 39449136833     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2007.10.008     Document Type: Article

References (8)

1. Borodin A., and El-yaniv R. Online Computation and Competitive Analysis (1998), Cambridge University Press, Cambridge
2. Chrobak M., Jawor W., Sgall J., and Tichy T. Online scheduling of equal-length jobs: randomization and restarts help. 31st International Colloquium on Automata Languages and Programming vol. 3142 (2004), Springer, Berlin 358-370
3. B. Coleman, W. Mao, Lookahead scheduling in a real-time context, in: Proceedings of the Sixth International Conference on Computer Science and Informatics, Durham, NC, USA, 2002, pp. 205-209
4. C. Ekelin, Clairvoyant non-preemptive EDF scheduling, in: 18th Euromicro Conference on Real-time Systems, Dresden, Germany, 2006, pp. 23-29
5. Goldman S.A., Parwatikar J., and Suri S. On-line scheduling with hard deadlines. Journal of Algorithms 34 (2000) 370-389
6. Hoogeveen H., Potts C.N., and Woeginger G.J. On-line scheduling on a single machine: Maximizing the number of early jobs. Operations Research Letters 27 (2000) 193-196
7. P. Keskinocak, Online algorithms with lookahead: A survey, ISYE working paper, 1999
8. Mao W., and Kincaid R.K. A look-ahead heuristic for scheduling jobs with release dates on a single machine. Computers and Operations Research 21 (1994) 1041-1050