Author:
Chrobak Marek,Epstein Leah,Noga John,Sgall Jiřı́,van Stee Rob,Tichý Tomáš,Vakhania Nodari
Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference13 articles.
1. On the competitiveness of on-line real-time task scheduling;Baruah;Real-Time Systems,1992
2. Online computation and competitive analysis;Borodin,1998
3. Ee-Chien Chang, Chee Yap, Competitive online scheduling with level of service, in: J. Wang (Ed.), Proceedings of the Seventh Annual International Computing and Combinatorics Conference, Lecture Notes in Computer Science, Vol. 2108, Springer, Berlin, 2001, pp. 453–462. To appear in J. of Scheduling.
4. F.Y.L. Chin, S.P.Y. Fung, On-line scheduling with partial job values: does timesharing or randomization help? (2002) Algorithmica [Manuscript], to appear.
5. Preemptive scheduling in overloaded systems;Chrobak,2002
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献