1. Garey, M.R., Johnson, D.S.: Computers and Intractability. A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York (1979)
2. Liu, C.L., Layland, J.W.: Scheduling algorithms for multiprogramming in a hard-real-time environment. J ACM 20(1), 46–61 (January 73)
3. Jackson, J.R.: Scheduling a production line to minimize maximum tardiness. Technical report, Mgt. Sci. Res. Project, Res. Rept. 43, UCLA, January (1955)
4. Salmani, V., Zargar, S.T., Naghibzadeh, M.: A modified maximum urgency first scheduling algorithm for real-time tasks. Trans. Eng. Comput. Technol., ISSN 1305–5313(November), 19–23 (2005)
5. Oh, S.-H., Yang, S.-M.: A modified least laxity scheduling algorithm. In: Proceedings of the 5th International Conference on Real-Time Systems and Applications, S. 31–36. Hiroshima, Japan, October (1998)