On preemptive resource constrained scheduling: Polynomial-time approximation schemes

SIAM Journal on Discrete Mathematics

Volumn 20, Issue 3, 2006, Pages 545-563

  Jansen, Klaus ^a   Porkolab, Lorant ^b  

^a UNIVERSITY OF KIEL   (Germany)

^b IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

Approximation algorithms; Linear programming; Scheduling

Indexed keywords

APPROXIMATION ALGORITHMS; LINEAR PROGRAMMING; MULTIPROCESSING SYSTEMS; POLYNOMIAL APPROXIMATION; RESOURCE ALLOCATION;

APPROXIMATE BLOCK SOLVERS; POLYNOMIAL-TIME APPROXIMATION SCHEMES;

SCHEDULING;

EID: 34247605220     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480101396949     Document Type: Article

References (59)

1. A. K. AMOURA, E. BAMPIS, C. KENYON, AND Y. MANOUSSAKIS, Scheduling independent multiprocessor tasks, Algorithmica, 32 (2002), pp. 247-261.
2. B. S. BAKER, E. G. COFFMAN, JR., AND R. L. RIVEST, Orthogonal packings in two dimensions, SIAM J. Comput., 9 (1980), pp. 846-855.
3. J. BLAZEWICZ, W. CELLARY, R. SLOWINSKI, AND J. WEGLARZ, Scheduling under Resource Constraints-Deterministic Models, Ann. Oper. Res. 7, Baltzer, Basel, 1986.
4. J. BLAZEWICZ, M. DRABOWSKI, AND J. WEGLARZ, Scheduling multiprocessor tasks to minimize schedule length, IEEE Trans. Computers, 35 (1986), pp. 389-393.
5. J. BLAZEWICZ, K. H. ECKER, E. PESCH, G. SCHMIDT, AND J. WEGLARZ, Scheduling in Computer and Manufacturing Systems, Springer-Verlag, Berlin, 1996.
6. J. BLAZEWICZ, J. K. LENSTRA, AND A. H. G. RINNOOY KAN, Scheduling subject to resource constraints: Classification and complexity, Discrete Appl. Math., 5 (1983), pp. 11-24.
7. A. CAPRARA, H. KELLERER, U. PFERSCHY, AND D. PISINGER, Approximation algorithms for knapsack problems with cardinality constraints, European J. Oper. Res., 123 (2000), pp. 333-345.
8. E. G. COFFMAN, JR., M. R. GAREY, D. S. JOHNSON, AND R. E. TARJAN, Performance bounds for level-oriented two-dimensional packing algorithms, SIAM J. Comput., 9 (1980), pp. 808-826.
9. A. K. CHANDRA, D. S. HIRSCHBERG, AND C. K. WONG, Approximate algorithms for some generalized knapsack problems, Theoret. Comput. Sci., 3 (1976), pp. 293-304.
10. C. CHEKURI AND S. KHANNA, On multidimensional packing problems, SIAM J. Comput., 33 (2004), pp. 837-851.
11. G. I. CHEN AND T. H. LAI, Scheduling independent jos on hypercubes, in Proceedings of the 5th Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Comput. Sci. 294, Springer-Verlag, New York, 1988, pp. 273-280.
12. M. DROZDOWSKI, On the complexity of multiprocessor task scheduling, Bull. Polish Acad. Sci., 43 (1995), pp. 381-392.
13. M. DROZDOWSKI, Scheduling multiprocessor tasks-an overview, European J. Oper. Res., 94 (1996), pp. 215-230.
14. J. DU AND J. Y.-T. LEUNG, Complexity of scheduling parallel task systems, SIAM J. Discrete Math., 2 (1989), pp. 473-487.
15. T. ERLEBACH AND K. JANSEN, Conversion of coloring algorithms into maximum weight independent set algorithms, Discrete Appl. Math., 148 (2005), pp. 107-125.
16. T. ERLEBACH, K. JANSEN, AND E. SEIDEL, Polynomial-time approximation schemes for geometric intersection graphs, SIAM J. Comput., 34 (2005), pp. 1302-1323.
17. U. FEIGE AND J. KILIAN, Zero knowledge and the chromatic number, J. Comput. System Sci., 57 (1998), pp. 187-199.
18. W. FERNANDEZ DE LA VEGA AND G. S. LUEKER, Bin packing can be solved within 1 + ε in linear time, Combinatorica, 1 (1981), pp. 349-355.
19. A. M. FRIEZE AND M. R. B. CLARKE, Approximation algorithms for the m-dimensional 0 - 1 knapsack problem, European J. Oper. Res., 15 (1984), pp. 100-109.
20. M. R. GAREY AND R. L. GRAHAM, Bounds for multiprocessor scheduling with resource constraints, SIAM J. Comput., 4 (1975), pp. 187-200.
21. M. R. GAREY, R. L. GRAHAM, D. S. JOHNSON, AND A. C-C. YAO, Resource constrained scheduling as generalized bin packing, J. Combin. Theory A, 21 (1976), pp. 251-298.
22. S. GERKE AND C MCDIARMID, Graph imperfection, J. Combin. Theory B, 83 (2001), pp. 58-78.
23. M. D. GRIGORIADIS AND L. G. KHACHIYAN, Coordination complexity of parallel price-directive decomposition, Math. Oper. Ros., 21 (1996), pp. 321-340.
24. M. D. GRIGORIADIS, L. G. KHACHIYAN, L. PORKOLAB, AND J. VILLAVICENCIO, Approximate max-min resource sharing for structured concave optimization, SIAM J. Optim., 11 (2001), pp. 1081-1091.
25. M. GRÖTSCHEL, L. LOVASZ, AND A. SCHRIJVER, The ellipsoid method and its consequences in combinatorial optimization, Coinbinatorica, 1 (1981), pp. 169-197.
26. M. GRÖTSCIIEL, L. LOVÁSZ, AND A. SCHRIJVER, Geometric. Algorithms and Combinatorial Optimization, Springer-Verlag, Berlin, 1988.
27. L. HALL AND D. SHMOYS, Jackson's rule for single machine scheduling: Making a good heuristic better, Math. Oper. Res., 17 (1992), pp. 22-35.
28. O. H. IBARRA AND C. E. KIM, Fast approximation algorithms for the knapsack and sum of subset problem, J. ACM, 22 (1975), pp. 463-468.
29. K. JANSEN AND L. PORKOLAH, Linear-time approximation schemes for scheduling malleable parallel tasks, Algorithmica, 32 (2002), pp. 507-520.
30. K. JANSEN AND L. PORKOLAB, Computing optimal preemptive schedules for parallel tasks: Linear programming approaches, Math. Program., 95 (2003), pp. 617-630.
31. K. JANSEN AND L. PORKOLAB, Preemptive scheduling on dedicated processors: Applications of fractional graph coloring, J. Sched., 7 (2004), pp. 35-48.
32. K. JANSEN, Approximate strong separation with application in fractional graph coloring and preemptive scheduling, Theoret. Comput. Sci., 302 (2003), pp. 239-256.
33. K. JANSEN, An approximation algorithm, for the general max-min resource sharing problem, Math. Program., 106 (2006), pp. 547-566.
34. H. KELLERER AND U. PKKRSCHY, A new fully polynomial approximation scheme for the knapsack problem, J. Combin. Optim., 3 (1999), pp. 59-71.
35. C. KENYON AND E. REMILA, A near-optimal solution to a two-dimensional cutting stock problem, Math. Oper. Res., 25 (2000), pp. 645-656.
36. K. KILAKOS AND O. MARXIOTTE, Fractional and integral colourings, Math. Programming, 76 (1997), pp. 333-347.
37. B. KORTE AND R. SCHRADER, On the existence of fast approximation schemes, in Nonlinear Programming 4, Academic Press, New York, 1981, pp. 415-437.
38. K. L. KRAUSE, V. Y. SHEN, AND H. D. SCHWETMAN, Analysis of several task scheduling algorithms for a model of multiprogramming computer systems, J. ACM, 22 (1975), pp. 522-550.
39. K. L. KRAUSE, V. Y. SHEN, AND H. D. SCHWETMAN, Errata: "Analysis of several task scheduling algorithms for a model of multiprogramming computer systems," J. ACM, 24 (1977), p. 527.
40. E. LAWLER, Fast approximation algorithms for knapsack problems, Math. Oper. Res., 4 (1979), pp. 339-356.
41. W. LUDWIG AND P. TIWARI, Scheduling malleable and nonmalleable parallel tasks, in Proceedings of the 5th ACM-SIAM Symposium on Discrete Algorithms, ACM, New York, SIAM, Philadelphia, 1994, pp. 167-176.
42. C. LUND AND M. YANNAKAKIS, On the hardness of approximating minimization problems, J. ACM, 41 (1994), pp. 960-981.
43. O. OGUZ AND M. J. MAGAZINE, A Polynomial Time Approximation Algorithm for the Multi-dimensional 0 -1 Knapsack Problem, Working paper, University of Waterloo, Waterloo, Ontario, Canada, 1980.
44. T. MATSUI, Approximation algorithms for maximum independent set problems and fractional coloring problems on unit disk graphs, in Proceedings of the Symposium on Discrete and Computational Geometry, Lecture Notes in Comput. Sci. 1763, Springer-Verlag, New York, 2000, pp. 194-200.
45. G. MOUNIE, C RAPINE, AND D. TRYSTRAM, Efficient approximation algorithms for scheduling malleable tasks, in Proceedings of the ACM Symposium on Parallel Algorithms, ACM, New York, 1999, pp. 23-32.
46. T. NIESSEN AND J. KIND, The round-up property of the fractional chromatic number for proper circular arc graphs, J. Graph Theory, 33 (2000), pp. 256-267.
47. S. A. PLOTKIN, D. B. SHMOYS, AND E. TARDOS, Fast approximation algorithms for fractional packing and covering problems, Math. Oper. Res., 20 (1995), pp. 257-301.
48. P. RAGHAVAN AND C. D. THOMPSON, Randomized rounding: A technique for provably good algorithms and algorithmic proofs, Combinatorica, 7 (1987), pp. 365-374.
49. M. W. SCHÄFFTER, Scheduling with forbidden sets, Discrete Appl. Math., 72 (1997), pp. 155-166.
50. I. SCHIERMEYER, Reverse-Fit: A 2-optimal algorithm for packing rectangles, in Proceedings of the 2nd European Symposium of Algorithms, Lecture Notes in Comput. Sci. 855, Springer-Verlag, New York, 1994, pp. 290-299.
51. E. R. SCHREINERMAN AND D. H. ULLMAN, Fractional Graph Theory: A Rational Approach to the Theory of Graphs, Wiley Interscience Series in Discrete Mathematics, John Wiley, New York, 1997.
52. P. D. SEYMOUR, Colouring series-parallel graphs, Combinatorica, 10 (1990), pp. 379-392.
53. A. SRINIVASAN, Improved approximation guarantees for packing and covering integer programs, SIAM J. Comput., 29 (1999), pp. 648-670.
54. A. SRIVASTAV AND P. STANGIER, Algorithmic Chernoff-Hoeffding inequalities in integer programming, Random Structures Algorithms, 8 (1996), pp. 27-58.
55. A. SRIVASTAV AND P. STANGIER, Tight approximations for resource constrained scheduling and bin packing, Discrete Appl. Math., 79 (1997), pp. 223-245.
56. A. STEINBERG, A strip-packing algorithm with absolute performance bound 2, SIAM J. Comput., 26 (1997), pp. 401-409.
57. J. TUREK, J. WOLF, AND P. YU, Approximate algorithms for scheduling parallelizable tasks, in Proceedings of the 4th ACM Symposium on Parallel Algorithms and Architectures, ACM, New York, 1992, pp. 323-332.
58. N. E. YOUNG, Randomized rounding without solving the linear program, in Proceedings of the 6th ACM-SIAM Symposium on Discrete Algorithms, ACM, New York, SIAM, Philadelphia, 1995, pp. 170-178.
59. Y. ZHU AND M. AHUJA, On job scheduling on a hypercube, IEEE Trans. Parallel Distributed Systems, 4 (1993), pp. 62-69.