Approximation algorithms for the job interval selection problem and related scheduling problems

Mathematics of Operations Research

Volumn 31, Issue 4, 2006, Pages 730-738

  Chuzhoy, Julia ^a,b   Ostrovsky, Rafail ^c   Rabani, Yuval ^d  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b UNIVERSITY OF PENNSYLVANIA   (United States)

^c Engineering IV   (United States)

^d TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Approximation algorithms; PTAS; Scheduling; Throughput

Indexed keywords

APPROXIMATION ALGORITHMS; JOB INTERVAL SELECTION PROBLEMS (JISP); MULTIPLE MACHINE ENVIRONMENTS; PTAS;

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; OPERATIONS RESEARCH; PROBLEM SOLVING; REAL TIME SYSTEMS; THROUGHPUT;

SCHEDULING;

EID: 33847180847     PISSN: 0364765X     EISSN: 15265471     Source Type: Journal    
DOI: 10.1287/moor.1060.0218     Document Type: Article

References (26)

1. Adler, M., A. L. Rosenberg, R. K. Sitaraman, W. Unger. 1998. Scheduling time-constrained communication in linear networks. Proc. 10th Annual ACM Sympos. Parallel Algorithms Architectures, 269-278.
2. Arkin, E. M., E. B. Silverberg. 1987. Scheduling jobs with fixed start and end times. Discrete Appl. Math. 18 1-8.
3. Baptiste, P. 1999. Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times. J. Scheduling 2 245-252.
4. Bar-Noy, A., S. Guha, J. Naor, B. Schieber. 2001. Approximating the throughput of multiple machines in real-time scheduling. SIAM J. Comput. 31(2) 331-352.
5. Bar-Noy, A., R. Bar-Yehuda, A. Freund, J. Naor, B. Schieber. 2001. A unified approach to approximating resource allocation and scheduling. J. ACM (JACM) 48(5) 1069-1090.
6. Baruah, S., G. Koren, D. Mao, B. Mishra, A. Raghunathan, L. Rosier, D. Shasha, F. Wang. 1992. On the competitiveness of on-line real-time task scheduling. Real-Time Systems 4 125-144.
7. Berman, P., B. DasGupta. 2000. Improvements in throughput maximization for real-time scheduling. Proc. 32nd Annual ACM Sympos. Theory Comput., May 2000.
8. Calinescu, G., A. Chakrabarti, H. J. Karloff, Y. Rabani. 2002. Improved approximation algorithms for resource allocation. IPCO 2002, the 9th Conference on Integer Programming and Combinatorial Optimization. Lecture Notes in Computer Science, Vol. 2337. Springer-Verlag, Berlin, Germany, 401-414.
9. Carlier, J. 1981. Probléme à une machine et algorithmes polynômiaux. Questio 5(4) 219-228.
10. Crama, Y., O. E. Flippo, J. J. van de Klundert, F. C. R. Spieksma. 1997. The assembly of printed circuit boards: A case with multiple machines and multiple board types. Eur. J. Oper. Res. 98 457-472.
11. Faigle, U., W. M. Nawijn. 1995. Note on scheduling intervals on-line. Discrete Appl. Math. 58 13-17.
12. Fischetti, M., S. Martello, P. Toth. 1987. The fixed job schedule problem with spread-time constraints. Oper. Res. 35 849-858.
13. Garey, M. R., D. S. Johnson. 1977. Two-processor scheduling with start times and deadlines. SIAM J. Comput. 6 416-426.
14. Golumbic, M. C. 1980. Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York.
15. Graves, S. C., A. H. G. Rinnooy Kan, P. H. Zipkin, eds. 1993. Logistics for Production and Inventory. Vol. 4, Handbooks of Operations Research. North-Holland, Amsterdam, The Netherlands.
16. Hall, N. G., M. J. Magazine. 1994. Maximizing the value of a space mission. Eur. J. Oper. Res. 78 224-241.
17. Jackson, J. R. 1955. Scheduling a production line to minimize maximum tardiness. Management Science Research Project Report, Research Report 43, University of California, Los Angeles, CA.
18. Koren, G. D. Shasha. 1995. An optimal on-line scheduling algorithm for overloaded real-time systems. SIAM J. Comput. 24 318-339.
19. Lawler, E. L., J. K. Lenstra, A. H. G. Rinnooy Kan, D. B. Shmoys. 1993. Sequencing and scheduling: Algorithms and complexity. Logistics for Production and Inventory, Vol. 4, Handbooks of Operations Research. North-Holland, Amsterdam, The Netherlands.
20. Lipton, R. J., A. Tomkins. 1994. Online interval scheduling. Proc. 5th Annual ACM-SIAM Sympos. Discrete Algorithms, 302-311.
21. Liu, H., M. E. Zarki. 1998. Adaptive source rate control for real-time wireless video transmission. Mobile Networks Appl. 3 49-60.
22. Moore, J. M. 1968. An n-job, one machine sequencing algorithm for minimizing the number of late jobs. Management Sci. 15 102-109.
23. Rajugopal, G. R., R. H. M. Hafez. 1998. Adaptive rate controlled, robust video communication over packet wireless networks. Mobile Networks Appl. 3 33-47.
24. Sahni, S. 1976. Algorithms for scheduling independent tasks. J. ACM 23 116-127.
25. Spieksma, F. C. R. 1999. On the approximability of an interval scheduling problem. J. Scheduling 2 215-227.
26. Yau, D. K. Y., S. S. Lam. 1997. Adaptive rate-controlled scheduling for multimedia applications. IEEE/ACM Trans. Networking 5(4) 475-488.