Approximation algorithms for scheduling with reservations

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

Volumn 4873 LNCS, Issue , 2007, Pages 297-307

  Diedrich, Florian ^a   Jansen, Klaus ^a   Pascual, Fanny ^b   Trystram, Denis ^b  

^a UNIVERSITY OF KIEL   (Germany)

^b UNIV GRENOBLE ALPES   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; OPTIMIZATION; PARALLEL PROCESSING SYSTEMS; PROBLEM SOLVING; SCHEDULING ALGORITHMS;

APPROXIMATION RATIOS; PARALLEL MACHINES;

APPROXIMATION ALGORITHMS;

EID: 38349039171     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-77220-0_29     Document Type: Conference Paper

References (23)

1. Caprara, A., Kellerer, H., Pferschy, U.: The multiple subset sum problem. Technical report, Technische Universität Graz (1998)
2. Caprara, A., Kellerer, H., Pferschy, U.: A PTAS for the multiple subset sum problem with different knapsack capacities. Inf. Process. Lett. 73(3-4), 111-118 (2000)
3. Caprara, A., Kellerer, H., Pferschy, U.: A 3/4-approximation algorithm for multiple subset sum. J. Heuristics 9(2), 99-111 (2003)
4. Chekuri, C., Khanna, S.: A polynomial time approximation scheme for the multiple knapsack problem. SIAM J. Comput. 35(3), 713-728 (2005)
5. Dawande, M., Kalagnanam, J., Keskinocak, P., Salman, F.S., Ravi, R.: Approximation algorithms for the multiple knapsack problem with assignment restrictions. J. Comb. Optim. 4(2), 171-186 (2000)
6. Garey, M.R., Johnson, D.S.: "strong" NP-completeness results: Motivation, examples, and implications. J. ACM 25(3), 499-508 (1978)
7. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman (1979)
8. Hochbaum, D.S., Shmoys, D.B.: Using dual approximation algorithms for scheduling problems: theoretical and practical results. J. ACM 34(1), 144-162 (1987)
9. Hwang, H.-C., Lee, K., Chang, S.Y.: The effect of machine availability on the worst-case performance of LPT. Disc. App. Math. 148(1), 49-61 (2005)
10. Ibarra, O.H., Kim, C.E.: Fast approximation algorithms for the knapsack and sum of subset problems. J. ACM 22(4), 463-468 (1975)
11. Kellerer, H.: A polynomial time approximation scheme for the multiple knapsack problem. In: Hochbaum, D.S., Jansen, K., Rolim, J.D.P., Sinclair, A. (eds.) RANDOM 1999 and APPROX 1999. LNCS, vol. 1671, pp. 51-62. Springer, Heidelberg (1999)
12. Kellerer, H., Mansini, R., Pferschy, U., Speranza, M.G.: An efficient fully polynomial approximation scheme for the subset-sum problem. J. Comput. Syst. Sci. 66(2), 349-370 (2003)
13. Kellerer, H., Pferschy, U.: A new fully polynomial time approximation scheme for the knapsack problem. J. Comb. Optim. 3(1), 59-71 (1999)
14. Kellerer, H., Pferschy, U., Pisinger, D.: Knapsack Problems. Springer, Heidelberg (2004)
15. Lawler, E.L.: Fast approximation algorithms for knapsack problems. Math. Oper. Res. 4(4), 339-356 (1979)
16. Lee, C.-Y.: Parallel machines scheduling with non-simultaneous machine available time. Disc. App. Math. 30, 53-61 (1991)
17. Lee, C.-Y.: Machine scheduling with an availability constraint. J. Global Optimizar tion, Special Issue on Optimization of Scheduling Applications 9, 363-384 (1996)
18. Lee, C.-Y., He, Y., Tang, G.: A note on parallel machine scheduling with nonsimultaneous machine available time. Disc. App. Math. 100(1-2), 133-135 (2000)
19. Leung, J.Y.-T. (ed.): Handbook of Scheduling. Chapman & Hall (2004)
20. Liao, C.-J., Shyur, D.-L., Lin, C.-H.: Makespan minimization for two parallel machines with an availability constraint. European J. of Operational Research 160, 445-456 (2003)
21. Martello, S., Toth, P.: Knapsack Problems: Algorithms and Computer Implementations. Wiley, Chichester (1990)
22. Sahni, S.: Algorithms for scheduling independent tasks. J. ACM 23(1), 116-127 (1976)
23. Scharbrodt, M., Steger, A., Weisser, H.: Approximability of scheduling with fixed jobs. J. Scheduling 2, 267-284 (1999)