1. Baruah, S. K., Koren, G., Mao, D., Mishra, B., Raghunathan, A., Rosier, L. E., et al. (1992). On the competitiveness of on-line real-time task scheduling. Real-Time Systems, 4, 125–144.
2. Ding, J., Ebenlendr, T., Sgall, J., & Zhang, G. (2007). Online scheduling of equal-length jobs on parallel machines. In Proceedings of 15th European Symposium on Algorithms, Vol. 4698 of Lecture Notes in Computer Science (pp. 427–438). New York: Springer.
3. Ding, J., & Zhang, G. (2006). Online scheduling with hard deadlines on parallel machines. In Proceedings of 2nd International Conference on Algorithmic Aspects in Information and Management, Vol. 4041 of Lecture Notes in Computer Science (pp. 32–42). New York: Springer.
4. Dürr, C., Jez, L., & Nguyen, K. T. (2009). Online scheduling of bounded length jobs to maximize throughput. In Proceedings of 7th International Workshop in Approximation and Online Algorithms, Vol. 5893 of Lecture Notes in Computer Science (pp. 116–127). New York: Springer.
5. Ebenlendr, T., & Sgall, J. (2008). A lower bound for scheduling of unit jobs with immediate decision on parallel machines. In Proceedings of 6th Workshop on Approximation and Online Algorithms, Vol. 5426 of Lecture Notes in Computer Science (pp. 43–52). New York: Springer.