1. Albers, S.: On randomized online scheduling. In: Proceedings of the Thirty Fourth Annual ACM Symposium on Theory of Computing, pp. 134–143 (2002)
2. Awerbuch, B., Bartal, Y., Fiat, A., Rosen, A.: Competitive non-preemptive call control. In: Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 312–320 (1994)
3. Baruah, S., Koren, G., Mao, D., Mishra, B., Raghunathan, A., Rosier, L., Shasha, D., Wang, F.: On the competitiveness of on-line real-time task scheduling. Real-Time Syst. 4(2), 125–144 (1992)
4. Bogart, K.P., West, D.B.: A short proof that ‘Proper = Unit’. Discrete Math. 201, 21–23 (1999)
5. Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, Cambridge (1998)