Algorithms and approximation schemes for minimum lateness/tardiness scheduling with rejection

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

Volumn 2748, Issue , 2003, Pages 79-90

  Sengupta, Sudipta ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; DYNAMIC PROGRAMMING; JOB SHOP SCHEDULING; OPTIMIZATION; POLYNOMIAL APPROXIMATION; POLYNOMIALS; PROBLEM SOLVING; PROGRAM PROCESSORS; SCHEDULING;

APPROXIMATION SCHEME; EARLIEST DUE DATES; FULLY POLYNOMIAL TIME APPROXIMATION SCHEMES; GEOMETRIC ROUNDING; MAXIMUM LATENESS; OBJECTIVE FUNCTION VALUES; OBJECTIVE FUNCTIONS; PSEUDO-POLYNOMIAL TIME ALGORITHMS;

APPROXIMATION ALGORITHMS;

EID: 33646134153     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45078-8_8     Document Type: Article

References (8)

1. 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.
2. E. L. Lawler, J. K. Lenstra, A. H. G. Rinooy Kan, and D. B. Shmoys. Sequencing and Scheduling: Algorithms and Complexity. Handbooks in Operations Research and Management Science, Vol. 4, Logistics of Production and Inventory, pp. 445-522, North-Holland, 1993.
3. Y. Bartal, S. Leonardi, A. Marchetti-Spaccamela, J. Sgall, and L. Stougie. Multiprocessor scheduling with rejection. 7th ACM-SIAM Symposium on Discrete Algorithms, pp. 95-103, 1996.
4. H. Hoogeveen, M. Skutella, and G. J. Woeginger. Preemptive scheduling with rejection. Algorithms - ESA 2000, 8th Annual European Symposium on Algorithms, September 2000, Lecture Notes in Computer Science, vol. 1879, pp. 268-277.
5. S. Seiden. Preemptive multiprocessor scheduling with rejection. Theoretical Computer Science, vol. 262, issue 1, pp. 437-458, July 2001.
6. D. W. Engels, D. R. Karger, S. G. Kolliopoulos, S. Sengupta, R. N. Uma, and J. Wein. Techniques for Scheduling with Rejection. Algorithms - ESA '98, 6th Annual European Symposium on Algorithms, August 1998, Lecture Notes in Computer Science, vol. 1461, pp. 490-501.
7. J. B. Orlin, A. S. Schulz, and S. Sengupta. ε-Optimization Schemes and L-Bit Precision: Alternative Perspectives in Combinatorial Optimization. 32nd Annual ACM Symposium on Theory of Computing (STOC), 2000.
8. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York, 1979.