Bounds on tardiness in scheduling of precedence-constrained unit real-time task systems

Computers and Electrical Engineering

Volumn 27, Issue 4, 2001, Pages 345-354

  Cheng, Bo Chao ^a   Stoyen, Alexander D ^b   Marlowe, Thomas J ^c   Baruah, Sanjoy ^d  

^a TELCORDIA TECHNOLOGIES   (United States)

^b UNIVERSITY OF NEBRASKA AT OMAHA   (United States)

^c SETON HALL UNIVERSITY   (United States)

^d UNIVERSITY OF NORTH CAROLINA   (United States)

Author keywords

Real time system; Theory of computation

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CONGESTION CONTROL (COMMUNICATION); CONSTRAINT THEORY; TELECOMMUNICATION TRAFFIC;

EARLIEST-DEADLINE-FIRST SCHEDULING ALGORITHMS; PRECEDENCE-CONSTRAINED REAL-TIME TASK SYSTEMS;

REAL TIME SYSTEMS;

EID: 0035400799     PISSN: 00457906     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0045-7906(00)00025-2     Document Type: Article

References (21)

1. Brucker P., Garey M.R., Johnson D.S. Scheduling equal-length tasks under treelike precedence constraints to minimize maximum lateness. Math Oper Res. 2:1977;275-284.
2. Cadambi B.V. One machine scheduling to minimize expected mean tardiness. Part I. Comput Oper Res. 18(8):1991;787-796.
3. Cheng B-C, Stoyenko AD, Marlowe TJ, Baruah S. The allocation and scheduling of precedence- and timing-constrained tasks with communication delays. Fourth Annual IEEE Workshop on Real-Time Applications, RTAW'96, October 21-25, Quebec, Canada, 1996.
4. Cheng B-C. Least space-time first scheduling algorithm: scheduling non-simple tasks with hard deadline on parallel machines. PhD thesis, Department of CIS, New Jersey Institute of Technology, USA, 1996.
5. Cheng B.-C., Stoyenko A.D., Marlowe T.J., Baruah S. A new scheduling policy for complex real-time tasks in multiple processor systems. Automatica. 33(5):1996;921-926.
6. Cheng T.C.E., Sin C.C.S. A state-of-the-art review of parallel-machine scheduling research. Eur J Oper Res. 47(3):1990;271-292.
7. Chu C. A branch-and-bound algorithm to minimize total tardiness with different release dates. Naval Res Logist. 39(2):1992;265-283.
8. Graham G.L. Bounds on multiprocessing timing anomalies. SIAM J Appl Math. 17:1969;416-429.
9. Graham R.L., Lawler E.L., Lenstra J.K., Rinnooy K. Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals Discrete Math. 5:1979;287-326.
10. Hall N.G., Posner M.E. Earliness-tardiness scheduling problems. I. weighted deviation of completion times about a common due date. Oper Res. 39(5):1991;836-946.
11. Holsenback J.E., Russell R.M. A heuristic algorithm for sequencing on one machine to minimize total tardiness. J Oper Res Soc. 43(1):1992;53-62.
12. Hu TC. Parallel sequencing and assembly line programs. Oper Res 1961;9:841-8.
13. Leung J. A new algorithm for scheduling periodic, real-time tasks. Algorithmica. 4:1989;209-219.
14. Lenstra J.K., Rinnooy K., Brucker P. Complexity of machine scheduling problems. Annals Discrete Math. 1:1977;343-362.
15. Liu C.L., Layland J. Scheduling algorithms for multiprogramming in a hard real-time environment. J ACM. 20(1):1973;46-61.
16. Liu J.W.S., Liu C.L., Deng Z., Tia T.S., Sun J., Storch M., Hull D., Redondo J.L., Bettati R., Silberman A. PERTS: a prototyping environment for real-time systems. Int J Software Engng Knowledge Engng. 6(2):1996;161-177.
17. O'Brien J.J. CPM in Construction Management, Scheduling by the Critical Path Method. 1965;McGraw-Hill, New York.
18. Pinedo M. Scheduling: Theory, Algorithms, and Systems. 1995;Prentice Hall, NJ.
19. Root J.G. Scheduling with deadlines and loss functions on k parallel machines. Manag Sci. 11:1965;460-475.
20. Stankovic J.A., Spuri M., Natole M.D., Buttazzo G.C. Implications of classical scheduling results for real-time systems. IEEE Comput. 28(6):1995;16-25.
21. Stoyenko A.D., Georgiadis L. On optimal lateness and tardiness scheduling in real-time systems. Computing. 47(3-4):1992;215-234.