Real-time scheduling with a budget

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

Volumn 2719, Issue , 2003, Pages 1123-1137

  Naor, Joseph ^a   Shachnai, Hadas ^a,b   Tamir, Tami ^c  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b LUCENT TECHNOLOGIES   (United States)

^c University of Washington   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; COSTS; INTERNET; JOB SHOP SCHEDULING; SCHEDULING; SCHEDULING ALGORITHMS;

APPROXIMATION FACTOR; COMBINATORIAL AUCTION; INTERNET CONNECTION; INTERVAL SELECTION; MULTIPLE MACHINE; REAL - TIME SCHEDULING; SINGLE- MACHINES; VEHICLE SCHEDULING;

BUDGET CONTROL;

EID: 33745430289     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45061-0_86     Document Type: Article

References (18)

1. E.M. Arkin and E.B. Sliverberg. "Scheduling jobs with fixed start and end times". Discrete Applied Math., 18:1-8, 1987.
2. P. Baptiste. Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times. J. of Scheduling, 2:245-252, 1999.
3. A. Bar-Noy, R. Bar-Yehuda, A. Freund, J. Naor, and B. Schieber. A unified approach to approximating resource allocation and scheduling. J. of the ACM, 48:1069-1090, 2001.
4. A. Bar-Noy, S. Guha, J. Naor and B. Schieber Approximating the through-put of real-time multiple machine scheduling. SIAM J. on Computing, 31:331-352, 2001.
5. P. Berman and B. DasGupta. "Multi-phase algorithms for throughput maximization for real-time scheduling." J. of Combinatorial Optimization, 4:307-323, 2000.
6. J. Chuzhoy, R. Ostrovsky, and Y. Rabani. "Approximation algorithms for the job interval selection problem and related scheduling problems." FOCS, 2001.
7. M.R. Garey and D.S. Johnson. Computers and intractability: a guide to the theory of NP-completeness. W.H. Freeman, 1979.
8. N. Garg, A 3-approximation for the minimum tree spanning k vertices, Proceedings of FOCS, 1996.
9. R. Hassin, Approximation schemes for the restricted shortest path problem. In Mathematics of Operations Research, 17(1): 36-42, 1992.
10. V. Kann. Maximum bounded 3-dimensional matching is max SNP-complete. Information Processing Letters, 37:27-35, 1991.
11. Y. Karuno and H. Nagamochi, A 2-approximation algorithm for the multi-vehicle scheduling problem on a path with release and handling times. ESA, 2001.
12. S. Khuller, A. Moss, J. Naor, The budgeted maximum coverage problem. Information Processing Letters 70(1): 39-45, 1999.
13. D. H. Lorenz and A. Orda, Optimal partition of QoS requirements on unicast paths and multicast trees, IEEE/ACM Trans. on Networking, 10(1), 102-114, 2002.
14. D. H. Lorenz, A. Orda, D. Raz, Y. Shavitt, Efficient QoS partition and routing of unicast and multicast, 8th Int. Workshop on Quality of Service, Pittsburgh, 2000.
15. J. Naor, H. Shachnai and T. Tamir Real-time Scheduling with a Budget, http://www.cs.technion.ac.il/∼hadas/PUB/rtbudget.ps.
16. F. C. R. Spieksma. "On the approximability of an interval scheduling problem." J. of Scheduling, 2:215-227, 1999.
17. M. Tennenholtz. Some tractable combinatorial auctions. AAAI/IAAI, 98-103, 2000.
18. V. Vazirani, Approximation algorithms, Springer Verlag, 2001.