Techniques for scheduling with rejection

Journal of Algorithms

Volumn 49, Issue 1, 2003, Pages 175-191

  Engels, Daniel W ^a   Karger, David R ^b   Kolliopoulos, Stavros G ^c   Sengupta, Sudipta ^b   Uma, R N ^d   Wein, Joel ^e  

^a USA   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c MCMASTER UNIVERSITY   (Canada)

^d The University of Texas at Dallas   (United States)

^e POLYTECHNIC UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; CONSTRAINT THEORY; LINEAR PROGRAMMING; OPTIMIZATION; PROBLEM SOLVING;

FACILITY-LOCATION PROBLEM; INTEGER PROGRAM;

SCHEDULING;

EID: 0242667531     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0196-6774(03)00078-6     Document Type: Article

References (26)

1. Y. Bartal, S. Leonardi, A. Marchetti-Spaccamela, J. Sgall, L. Stougie, Multiprocessor scheduling with rejection, in: Proceedings of the 7th ACM-SIAM Symposium on Discrete Algorithms, 1996, pp. 95-103.
2. C. Chekuri, R. Motwani, B. Natarajan, C. Stein, Approximation techniques for average completion time scheduling, in: Proceedings of the 8th ACM-SIAM Symposium on Discrete Algorithms, 1997, pp. 609-618.
3. F. Chudak, A min-sum 1.5-approximation algorithm for scheduling unrelated parallel machines, J. Scheduling 2 (2) (1999).
4. F.A. Chudak, Improved approximation algorithms for uncapacitated facility location, in: R.E. Bixby, E.A. Boyd, R.Z. Ríos-Mercado (Eds.), IPCO: 6th Integer Programming and Combinatorial Optimization Conference, in: Lecture Notes in Comput. Sci., Vol. 1412, Springer-Verlag, Berlin, pp. 180-194.
5. M.E. Dyer, L.A. Wolsey, Formulating the single machine sequencing problem with release dates as a mixed integer program, Discrete Appl. Math. 26 (1990) 255-270.
6. M.R. Garey, D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, New York, 1979.
7. M. Goemans, Improved approximation algorithms for scheduling with release dates, in: Proceedings of the 8th ACM-SIAM Symposium on Discrete Algorithms, 1997, pp. 591-598.
8. R.L. Graham, E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan Optimization and approximation in deterministic sequencing and scheduling: a survey, Ann. Discrete Math. 5 (1979) 287-326.
9. S. Guha, S. Khuller, Greedy strikes back: Improved facility location algorithms, in: Proceedings of the 9th ACM-SIAM Symposium on Discrete Algorithms, 1998.
10. L.A. Hall, A.S. Schulz, D.B. Shmoys, J. Wein, Scheduling to minimize average completion time: off-line and on-line approximation algorithms, Math. Oper. Res. 3 (1997) 513-544.
11. L.A. Hall, D.B. Shmoys, J. Wein, Scheduling to minimize average completion time: off-line and on-line algorithms, in: Proceedings of the 7th ACM-SIAM Symposium on Discrete Algorithms, 1996, pp. 142-151.
12. O. Ibarra, C.E. Kim, Fast approximation algorithms for the knapsack and sum of subset problems, J. ACM (1975) 463-468.
13. E.L. Lawler, J.M. Moore, A functional equation and its application to resource allocation and sequencing problems, Manage. Sci. 16 (1969) 77-84.
14. E.L. Lawler, D.B. Shmoys, Weighted number of late jobs (preliminary version) Chapter 5, in: J.K. Lenstra, D.B. Shmoys (Eds.), Scheduling, Wiley, in press.
15. W.L. Maxwell, Personal communication, 1996.
16. A. Munier, M. Queyranne, A.S. Schulz, Approximation bounds for a general class of precedence constrained parallel machine scheduling problems, in: R.E. Bixby, E.A. Boyd, R.Z. Ríos-Mercado (Eds.), IPCO: 6th Integer Programming and Combinatorial Optimization Conference, in: Lecture Notes in Comput. Sci., Vol. 1412, Springer-Verlag, Berlin, 1998, pp. 367-382.
17. I.M. Ovacik, R. Uzsoy, Decomposition Methods for Complex Factory Scheduling Problems, Kluwer, 1997.
18. C. Phillips, C. Stein, J. Wein, Minimizing average completion time in the presence of release dates, Math. Programming B 82 (1998) 199-224.
19. M.H. Rothkopf, Scheduling independent tasks on parallel processors, Manage. Sci. 12 (1966) 437-447.
20. A.S. Schulz, M. Skutella, Random-based scheduling: New approximations and LP lower bounds, in: J. Rolim (Ed.), Randomization and Approximation Techniques in Computer Science, Proceedings of the International Workshop RANDOM '97, in: Lecture Notes in Comput. Sci., Vol. 1269, Springer-Verlag, Berlin, 1997, pp. 119-133.
21. A.S. Schulz, M. Skutella, Scheduling-LPs bear probabilities: Randomized approximations for min-sum criteria, in: R. Burkard, G. Woeginger (Eds.), Algorithms, ESA '97, Proceedings of the 5th Annual European Symposium on Algorithms, in: Lecture Notes in Comput. Sci., Vol. 1284, Springer-Verlag, Berlin, 1997, pp. 416-429.
22. S. Seiden, Preemptive multiprocessor scheduling with rejection, Theoret. Comput. Sci. (2000), submitted for publication.
23. D.B. Shmoys, É. Tardos, K. Aardal, Approximation algorithms for facility location problems, in: Proceedings of the 29th Annual ACM Symposium on Theory of Computing, 1997, pp. 265-274.
24. W.E. Smith, Various optimizers for single-stage production, Naval Res. Logist. Quarterly 3 (1956) 59-66.
25. R.N. Uma, Theoretical and experimental perspectives on hard scheduling problems, PhD thesis, Polytechnic University, Brooklyn, NY, July 2000.
26. G.J. Woeginger, When does a dynamic programming formulation guarantee the existence of an FPTAS? in: Proceedings of the 10th ACM-SIAM Symposium on Discrete Algorithms, 1999, pp. 820-829.