Real-time scheduling with a budget

Algorithmica (New York)

Volumn 47, Issue 3, 2007, Pages 343-364

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

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b LUCENT TECHNOLOGIES   (United States)

^c INTERDISCIPLINARY CENTER   (Israel)

Author keywords

Approximation algorithms; Job interval selection; Real time scheduling

Indexed keywords

JOB INTERVAL SELECTION; MULTIPLE MACHINES; REAL-TIME SCHEDULING;

APPROXIMATION ALGORITHMS; COMPUTATIONAL COMPLEXITY; JOB ANALYSIS; OPTIMIZATION; REAL TIME SYSTEMS; SCHEDULING;

PROBLEM SOLVING;

EID: 33947164890     PISSN: 01784617     EISSN: 14320541     Source Type: Journal    
DOI: 10.1007/s00453-006-0191-8     Document Type: Article

References (19)

1. E.M. Arkin and E.B. Sliverberg. Scheduling jobs with fixed start and end times. Discrete Applied Mathematics, 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. Journal of Scheduling, 2:245-252, 1999.
3. P. Berman and B. DasGupta. Multi-phase algorithms for throughput maximization for real-time scheduling. Journal of Combinatorial Optimization, 4:307-323, 2000.
4. A. Bar-Noy, R. Bar-Yehuda, A. Freund, J. Naor, and B. Schieber. A unified approach to approximating resource allocation and scheduling. Journal of the ACM, 48:1069-1090, 2001.
5. A. Bar-Noy, S. Guha, J. Naor, and B. Schieber. Approximating the throughput of real-time multiple machine scheduling. SIAM Journal on Computing, 31:331-352, 2001.
6. J. Chuzhoy, R. Ostrovsky, and Y. Rabani. Approximation algorithms for the job interval selection problem and related scheduling problems. In Proceedings of FOCS, 2001.
7. N. Garg. A 3-approximation for the minimum tree spanning k vertices. Proceedings of FOCS, pages 302-309, 1996.
8. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco, CA, 1979.
9. R. Hassin. Approximation schemes for the restricted shortest path problem. Mathematics of Operations Research, 17(1):36-42, 1992.
10. K. Jain and V. Vazirani. Approximation algorithms for metric facility location and k-median problems using the primal-dual schema and Lagrangian relaxation. Journal of the ACM, 48(2):274-269, 2001.
11. V. Kann. Maximum bounded 3-dimensional matching is max SNP-complete. Information Processing Letters, 37:27-35, 1991.
12. S. Khuller, A. Moss, and J. Naor. The budgeted maximum coverage problem. Information Processing Letters, 70(1):39-45, 1999.
13. Y. Karuno and H. Nagamochi. 2-Approximation algorithms for the multi-vehicle scheduling on a path with release and handling times. Discrete Applied Mathematics, 129:433-447, 2003.
14. A. Levin. Real time scheduling with a budget: parametric-search is better than binary search. Manuscript, 2005.
15. D. H. Lorenz and A. Orda. Optimal partition of QoS requirements on unicast paths and multicast trees. IEEE/ACM Transactions on Networking, 10(1):102-114, 2002.
16. D. H. Lorenz, A. Orda, D. Raz, and Y. Shavitt. Efficient QoS partition and routing of unicast and multicast, Proceedings of the Eighth International Workshop on Quality of Service (IWQoS 2000), Pittsburgh, pages 75-83, June 2000.
17. F.C.R. Spieksma. On the approximability of an interval scheduling problem. Journal of Scheduling, 2:215-227, 1999.
18. M. Tennenholtz. Some tractable combinatorial auctions. Proceedings of AAAI/IAAI, pages 98-103, 2000.
19. V. Vazirani. Approximation Algorithms. Springer-Verlag, New York, 2001.