Al-Mouhamed, "Lower bound on the number of processors and time for scheduling precedence graphs with communication costs", IEEE Trans. on software engineering, vol. 16, No. 12, pp. 1390-1401, Dec. 1990. |
Schwan et al., "Dynamic scheduling of hard real-time tasks and real-time threads", IEEE Trans. on software engineering, vol. 18, No. 8, pp. 736-748, Aug. 1992. |
Yuan et al., "A decomposition approach to non-preemptive scheduling in hard real-time systems", IEEE, pp. 240-248, 1989. |
Panwalkar et al., "A survey of scheduling rules", Operations Research, vol.25, No. 1, pp. 45-60, Jan. 1977. |
Zhao et al., "Simple and integrated heuristic algorithms for scheduling tasks with time and resource constraints", Journal of systems & software, vol. 7, Iss:3, pp. 195-205, 1987. |
Saksena et al., "Temporal analysis for hard real-time scheduling", IEEE 1993, pp. 538-544. |
Noller, D., "Program gives best choices for scheduling meetings", Industrial Engineering, vol.16, No.1, Jan. 1984. |
Fersko-Weiss, "Super project expert", PC Magazine; vol.9, No. 15, p.358(2), Sep. 1990. |
Zhao et al., "Scheduling tasks with resource requirements in hard real-time systems", IEEE Trans. on software engineering, vol. SE-31, No.5, New York, pp. 564-576, May 1987. |
Sprunt et al., "Aperiodic task scheduling for hard real-time systems", Proc. of the IEEE, vol.82, No.1, New York, pp. 55-67, Jan. 1994. |
Lorts et al., "Empirical evaluation of weighted and prioritized static scheduling heuristics for real-time multi-processing", IEEE 1994, pp. 58-72. |