Lower bounds for on-line single-machine scheduling

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

Volumn 2136, Issue , 2001, Pages 338-350

  Epstein, Leah ^a   van Stee, Rob ^b  

^a INTERDISCIPLINARY CENTER   (Israel)

^b CWI   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

SCHEDULING;

LOWER BOUNDS; OPTIMALITY CRITERIA; RANDOMIZED ALGORITHMS; SCHEDULING JOBS; SINGLE- MACHINES; SINGLE-MACHINE SCHEDULING; TOTAL COMPLETION TIME; TOTAL FLOWTIME;

SCHEDULING ALGORITHMS;

EID: 84974674636     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44683-4_30     Document Type: Conference Paper

References (18)

1. F. Afrati, E. Bampis, C. Chekuri, D. Karger, C. Kenyon, S. Khanna, I. Milis, M. Queyranne, M. Skutella, C. Stein, and M. Sviridenko. Approximation schemes for minimizing average weighted completion time with release dates. In Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science, pages 32-43, October 1999.
2. A. Borodin and R. El-Yaniv. Online Computation and Competitive Analysis. Cambridge University Press, 1998.
3. C. Chekuri, S. Khanna, and A. Zhu. Algorithms for minimizing weighted flow time. In Proc. of the 33th Symp. on Theory of Computing (STOC), 2001.
4. C. Chekuri, R. Motwani, B. Natarajan, and C. Stein. Approximation techniques for average completion time scheduling. In Proceedings of the Eighth Annual ACMSIAM Symposium on Discrete Algorithms (SODA’97), pages 609-618. SIAM, Philadelphia, PA, 1997.
5. M. X. Goemans, M. Queyranne, A. S. Schulz, M. Skutella, and Y. Wang. Single machine scheduling with release dates. manuscript, 1999.
6. Michel X. Goemans. Improved approximation algorithms for scheduling with release dates. In Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 591-598, New York / Philadelphia, 1997. ACM / SIAM.
7. J. A. Hoogeveen and A. P. A. Vestjens. Optimal on-line algorithms for singlemachine scheduling. In Proc. 5th Int. Conf. Integer Programming and COmbinatorial Optimization, LNCS, pages 404-414. Springer, 1996.
8. H. Kellerer, T. Tautenhahn, and G. J. Woeginger. Approximability and nonapproximability results for minimizing total flow time on a single machine. In Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, pages 418-426, Philadelphia, Pennsylvania, 1996.
9. J. Labetoulle, E. L. Lawler, J. K. Lenstra, and A. H. G. Rinnooy Kan. Preemptive scheduling of uniform machines subject to release dates. Progress in Combinatorial Optimization, pages 245-261, 1984.
10. E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, and D. B. Shmoys. Sequencing and scheduling: algorithms and complexity. In Handbooks in operations research and management science, volume 4, pages 445-522. North Holland, 1993.
11. C. A. Phillips, C. Stein, and J. Wein. Scheduling jobs that arrive over time. In Proceedings of the 4th Workshop on Algorithms and Data Structures (WADS’95), volume 955 of Lecture Notes in Computer Science, pages 86-97. Springer, 1995.
12. A. S. Schulz and M. Skutella. The power of alpha-points in preemptive single machine scheduling. manuscript, 1999.
13. M. Skutella. personal communication, 2000.
14. W. E. Smith. Various optimizers for single-stage production. Naval Research and Logistics Quarterly, 3:59-66, 1956.
15. L. Stougie. Unpublished manuscript, 1995.
16. L. Stougie and A. P. A. Vestjens. Randomized on-line scheduling: How low can’t you go? Unpublished manuscript, 1997.
17. A. P. A. Vestjens. On-line machine scheduling. Technical report, Ph.D. thesis, Eindhoven University of Technology, The Netherlands, 1997.
18. A. C. Yao. Probabilistic computations: Towards a unified measure of complexity. In Proc. 18th Annual Symposium on Foundations of Computer Science, pages 222-227. IEEE, 1977.