The Lazy Bureaucrat scheduling problem

Information and Computation

Volumn 184, Issue 1, 2003, Pages 129-146

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

^a Stony Brook University   (United States)

Author keywords

Approximation algorithms; Dynamic programming; Lazy Bureaucrat; NP completeness; Optimization; Scheduling

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; CONSTRAINT THEORY; JOB ANALYSIS; SCHEDULING; THEOREM PROVING;

APPROXIMATION ALGORITHMS; LAZY BEREAUCRAT SCHEDULING; POLYNOMIAL TIME ALGORITHMS;

DYNAMIC PROGRAMMING;

EID: 0037789572     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0890-5401(03)00060-9     Document Type: Article

References (15)

1. E.M. Arkin, M.A. Bender, J.S.B. Mitchell, S.S. Skiena, The Lazy Bureaucrat scheduling problem, in: Proceedings of the Sixth Workshop on Discrete Algorithms (WADS), Lecture Notes in Computer Science, vol. 1663, Springer-Verlag, 1999, pp. 122-133.
2. A. Bar-Noy, S. Guha, J. Naor, B. Schieber, Approximating the throughput of real-time multiple machine scheduling, in: Proceedings of the 31st ACM Symposium Theory of Computing (STOC), 1999, pp. 622-631.
3. A.I. Barvinok, D.S. Johnson, G.J. Woeginger, R. Woodroofe, The maximum traveling salesman problem under polyhedral norms, in: Proceedings of the Sixth Conference on Integer Programming and Combinatorial Optimization (IPCO), Lecture Notes in Computer Science, vol. 1412, Springer-Verlag 1998, pp. 195-201.
4. S.P. Fekete, Simplicity and hardness of the maximum traveling salesman problem under geometric distances. in: Proceedings of the 10th ACM-SIAM Symposium on Discrete Algorithms (SODA), 1999, pp. 337-345.
5. M.R. Garey, D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman, San Francisco, 1979.
6. M.X. Goemans, D.P. Williamson, Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming, Journal of ACM 42 (1995) 1115-1145.
7. R. Hassin, S. Rubinstein, An approximation algorithm for the maximum traveling salesman problem, Information Processing Letters 67(3) (1998) 125-130.
8. C. Hepner, C. Stein, Minimizing makespan for the lazy bureaucrat problem, in: Proceedings of the Eighth Scandinavian Workshop on Algorithm Theory (SWAT), Lecture Notes in Computer Science, vol. 2368, Springer-Verlag, 2002, pp. 40-50.
9. D. Karger, R. Motwani, G. Ramkumar, On approximating the longest path in a graph, Algorithmica 18 (1) (1997) 82-98.
10. D. Karger, C. Stein, J. Wein, Scheduling algorithms, Algorithms and Theory of Computation Handbook, CRC Press, Boca raton, 1999.
11. T. Keneally, Schindler's List, Touchstone Publishers, New York, 1993.
12. S. R. Kosaraju, J.K. Park, C. Stein, Long tours and short superstrings (preliminary version), in: Proceedings of the 35th Annual Symposium on Foundations of Computer Science (FOCS), 1994, pp. 166-177.
13. E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, D.B. Shmoys, Sequencing and scheduling: algorithms and complexity, in: S.C. Graves, P.H. Zipkin, A.H.G. Rinnooy Kan (Eds.), Logistics of Production and Inventory: Handbooks in Operations Research and Management Science, vol. 4, North-Holland, Amsterdam, 1993, pp. 445-522.
14. E.L. Lawler, J.M. Moore, A functional equation and its application to resource allocation and sequencing problems, Management Science 16 (1969) 77-84.
15. M. Pinedo, Scheduling: Theory, Algorithms, and Systems, Prentice Hall, Englewood Cliffs, NJ, 1995.