Scheduling jobs with multiple feasible intervals

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

Volumn 2968, Issue , 2004, Pages 53-71

  Shih, Chi Shcng ^a   Liu, Jane W S ^b   Cheong, Infan Kuok ^c  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^b MICROSOFT   (United States)

^c BMC Software   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BRANCH AND BOUND METHOD; EMBEDDED SYSTEMS; OPTIMIZATION; REAL TIME SYSTEMS; SCHEDULING; SCHEDULING ALGORITHMS;

BRANCH-AND-BOUND ALGORITHMS; EDF ALGORITHM; NP-HARD; OPTIMAL ALGORITHM; REAL TIME; SCHEDULING JOBS; SIMPLE HEURISTICS;

JOB SHOP SCHEDULING;

EID: 35048890656     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24686-2_4     Document Type: Article

References (11)

1. I. K. Cheong. Scheduling Imprecise Hard Real-Time Jobs with Cumulative Error. PhD thesis, University of Illinois at Urbana-Champaign, 1992.
2. G. Koren and D. Shasha. Skip-over: Algorithms and complexity for overloaded systems that allow skips. In Proceedings of the IEEE Real-Time Systems Symposium, pages 110-117, 1995.
3. H. Aydin, P. Mejia-Alvarez, R. G. Melhem, and D. Mossè. Optimal reward-based scheduling of periodic real-time tasks. In Proceedings of the IEEE Real-Time Systems Symposium, pages 79-89, 1999.
4. J.-Y. Chung, J. W.-S. Liu, and K.-J. Lin. Scheduling periodic jobs that allow imprecise results. IEEE Transaction on Computers, 39(9):1156 - 1175, September 1990.
5. M. Hamdaoui and P. Ramanathan. A dynamic priority assignment technique for streams with (m, k)-firm deadlines. IEEE Transaction on Computers, 44(12):1443 - 1451, December 1995.
6. C. L. Liu and J. Layland. Scheduling algorithms for multiprogramming in a hard real-time environment. Journal of the ACM, 20(1):46-61, 1973.
7. C.-C. Han and K.-J. Lin. Scheduling distance-constrained real-time tasks. In Proceedings of the IEEE Real-Time Systems Symposium, pages 300 - 308, Dec. 1992.
8. B. Sprunt, L. Sha, and J. Lehoczky. Aperiodic task scheduling for hard-real-time systems. Real-time Systems Journal, July 1989.
9. M. R. Garey and D. S. Johnson. Computers and intractability: a guide to the theory of NP-completeness. W. H. Freeman, 1979.
10. Z. Deng, J. W.-S. Liu, and J. Sun. A scheme for scheduling hard real-time application in open system environment. In Proceedings of the 9th Euromicro Conference on Real-Time Systems, pages 191-199, Toledo, Spain, June 1997. IEEE.
11. J. W.-S. Liu. Real-Time Systems. Prentice Hall Inc., 2000.