Minimizing makespan for the lazy bureaucrat problem

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

Volumn 2368, Issue , 2002, Pages 40-50

  Hepner, Clint ^a   Stein, Cliff ^b  

^a Dartmouth College   (United States)

^b Department of Earth and Environmental Sciences   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

MINIMIZING MAKESPAN; PRE-EMPTIVE SCHEDULING; PSEUDO-POLYNOMIAL TIME ALGORITHMS; SCHEDULING PROBLEM;

SCHEDULING;

EID: 84943277674     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45471-3_5     Document Type: Conference Paper

References (4)

1. E. M. Arkin, M. A. Bender, J. S. B. Mitchell, and S. S. Skiena. The lazy bureaucrat scheduling problem. WADS’99, 1999.
2. R. L. Graham, E. L. Lawler, J. K. Lenstra, and A. H. G. Rinnooy Kan. Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics, 5:287-326, 1979.
3. T. Keneally. Schindler’s list. Touchstone Publishers, 1993.
4. 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.