Approximation algorithms for scheduling multiple feasible interval jobs

Proceedings - 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications

Volumn , Issue , 2005, Pages 11-16

  Chen, Jian Jia ^a   Wu, Jun ^b   Shih, Chi Sheng ^a   Kuo, Tei Wei ^a  

^a NATIONAL TAIWAN UNIVERSITY   (Taiwan)

^b CHINA UNIVERSITY OF TECHNOLOGY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; OPTIMIZATION; REAL TIME SYSTEMS;

APPROXIMATION ALGORITHMS; FEASIBLE INTERVAL JOBS; PREEMPTIBLE JOBS; SCHEDULING ALGORITHMS;

SCHEDULING;

EID: 33749075358     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/RTCSA.2005.28     Document Type: Conference Paper

References (10)

1. H. Aydin, R. Melhem, D. Mosse, and P. Alvarez. Optimal reward-based scheduling for periodic real-time tasks. In Proceedings of the 20th IEEE Real-Time Systems Symposium (RTSS'99), pages 79-89, 1999.
2. 4) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs. Operations Research Letters, 24:175-180, 1999.
3. J. Carlier. The one machine sequencing problem. European Journal of Operational Research, 11:42-41, 1982.
4. M. Hamdaoui and P. Ramanathan. A dynamic priority assignment technique for streams with (m, k)-RM deadlines. IEEE Transaction on Computers, 44(12):1443-1451, 1995.
5. G. Koren and D. Shasha. Skip-over: Algorithms and complexity for overloaded systems that allow skips. In Proceedings of IEEE Real-Time System Symposium, pages 110-117, 1995.
6. E. L. Lawler. A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs. Operations Research, 26(1):125-133, 1990.
7. J. W.-S. Liu, K.-J. Lin, W. K. Shih, A. C. shi Yu, J.-Y. Chung, and W. Zhao. Algorithms for scheduling imprecise computations. IEEE Computer, 24(5):58-68, 1991.
8. C.-S. Shih, J. W.-S. Liu, and I. K. Cheong. Scheduling jobs with multiple feasible intervals. In Proceedings of the IEEE Real-Time and Embedded Computing Systems and Applications, pages 53-71, 2003.
9. W. K. Shih and J. W.-S. Liu. Algorithms for scheduling imprecise computations with timing constraints to minimize maximum error. IEEE Transaction on Computers, 44(3):466-471, 1995.
10. V. V. Vazirani. Approximation Algorithms. Springer, 2001.