Publisher
Springer Berlin Heidelberg
Reference18 articles.
1. B.S. Baker, E.G. Coffman, Jr, and R.L. Rivest. Orthogonal packings in two dimensions. In The SIAM Journal of Computing, pages 846–855, 1980.
2. Y. Bartal, A. Fiat, H. Karloff, and R. Vohra. New algorithms for an ancient scheduling problem. In Proc. 24th ACM Symp. on Theory of Computing, pages 51–58, 1992.
3. Y. Bartal, H. Karloff, Y. Rabani. A better lower bound for on-line scheduling. In Information Processing Letters 50 pages 113–116, 1994.
4. B. Chen, and A. van Vliet. On the on-line scheduling algorithm RLS Report 9325/A, Econometric Institute, Erasmus University, Rotterdam. 1993.
5. B. Chen, A. van Vliet, and G.J. Woeginger. New lower and upper bounds for on-line scheduling. In Operations Research Letters, pages 222–230, 1994.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献