The lazy bureaucrat scheduling problem

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

Volumn 1663, Issue , 1999, Pages 122-133

  Arkin, Esther M ^a   Bender, Michael A ^b   Mitchell, Joseph S B ^a   Skiena, Steven S ^b  

^a STONY BROOK UNIVERSITY   (United States)

^b Stony Brook University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES;

OPTIMAL SCHEDULE; SCHEDULING PROBLEM;

SCHEDULING;

EID: 84948992864     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48447-7_14     Document Type: Conference Paper

References (7)

1. A. Bar-Noy, S. Guha, J. Naor, and B. Schieber. Approximating the throughput of real-time multiple machine scheduling. In Proc. 31st ACM Symp. Theory of Computing, 1999.
2. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the theory of NP-completeness. W. H. Freeman, San Francisco, 1979.
3. D. Karger, C. Stein, and J. Wein. Scheduling algorithms. In CRC Handbook of Computer Science, 1997. To appear.
4. T. Keneally. Schindler's List. Touchstone Publishers, New York, 1993.
5. E. Lawler, J. Lenstra, A. Kan, and D. Shmoys. Sequencing and scheduling: Algorithms and complexity. In Handbooks of Operations Research and Management Science, volume 4, pages 445-522. Elsevier Science Publishers B.V., 1993.
6. E. L. Lawler and J. M. Moore. A functional equation and its application to resource allocation and sequencing problems. Management Science, 16:77-84, 1969.
7. M. Pinedo. Scheduling: Theory, Algorithms, and Systems. Prentice Hall, 1995.