Improved competitive algorithms for online scheduling with partial job values

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2697, Issue , 2003, Pages 425-434

  Chin, Francis Y L ^a   Fung, Stanley P Y ^a  

^a UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 35048884197     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45071-8_43     Document Type: Article

References (14)

1. S. Baruah, G. Koren, D. Mao, B. Mishra, A. Raghunathan, L. Rosier, D. Shasha and F. Wang, On the Competitiveness of On-line Real-time Task Scheduling, Real-Time Systems 4, 125-144, 1992.
2. A. Borodin and R. El-Yaniv, Online Computation and Competitive Analysis, Cambridge University Press, New York, 1998.
3. E. Chang and C. Yap, Competitive Online Scheduling with Level of Service, Proceedings of 7th Annual International Computing and Combinatorics Conference, 453-462, 2001.
4. F. Y. L. Chin and S. P. Y. Fung, Online Scheduling with Partial Job Values and Bounded Importance Ratio, Proceedings of International Computer Symposium, 787-794, 2002.
5. F. Y. L. Chin and S. P. Y. Fung, Online Scheduling with Partial Job Values: Does Timesharing or Randomization Help? to appear in Algorithmica.
6. M. Chrobak, L. Epstein, J. Noga, J. Sgall, R. van Stee, T. Tichý and N. Vakhania, Preemptive Scheduling in Overloaded Systems, preliminary version appeared in Proceedings of 29th International Colloqium on Automata, Languages and Programming, 800-811, 2002.
7. B. Kalyanasunaram and K. Pruhs, Speed is as Powerful as Clairvoyance, Journal of the A CM 47(4), 617-643, 2000.
8. C.-Y. Koo, T.-W. Lam, T.-W. Ngan and K.-K. To, Extra Processors versus Future Information in Optimal Deadline Scheduling, Proceedings of 15th ACM Symposium on Parallelism in Algorithms and Architectures, 133-142, 2002.
9. over: An Optimal On-line Scheduling Algorithm for Overloaded Uniprocessor Real-time Systems, SIAM Journal on Computing 24, 318-339, 1995.
10. T.-W. Lam and K.-K. To, Performance Guarantee for Online Deadline Scheduling in the Presence of Overload, Proceedings of 12th Annual ACM-SIAM Symposium on Discrete Algorithms, 755-764, 2001.
11. J. W. S. Liu, K.-J. Lin, W.-K. Shih, A. C.-S. Yu, J.-Y. Chung and W. Zhao, Algorithms for Scheduling Imprecise Computations, IEEE Computer 24(5), 58-68, 1991.
12. C. A. Philips, C. Stein, E. Torng and J. Wein, Optimal Time-critical Scheduling via Resource Augmentation, Proceedings of 29th Annual ACM Symposium on Theory of Computing, 140-149, 1997.
13. D. Sleator and R. Tarjan, Amortized Efficiency of List Update and Paging Rules, Communications of the ACM 28(2), 202-208, 1985.
14. A. C.-C. Yao, Probabilistic Computations: Toward a Unified Measure of Complexity, Proceedings of 18th IEEE Symposium on Foundations of Computer Science, 222-227, 1977.