[1] Azar, Y., Naor, J., Rom, R., 1995. The competitiveness of on-line assignments. Journal of Algorithms, 18(2):221-237.

[2] Epstein, L., Favrholdt, L., 2002. Optimal preemptive semi-online scheduling to minimize makespan on two related machines. Operations Research Letters, 30(4):269-275.

[3] He, Y., Jiang, Y.W., 2004. Optimal algorithms for semi-online preemptive scheduling problems on two uniform machines. Acta Informatica, 40(5):367-383.

[4] Hwang, H., Chang, S., Lee, K., 2004. Parallel machine scheduling under a grade of service provision. Computers & Operations Research, 31(12):2055-2061.

[5] Lee, C.Y., 1991. Parallel machine scheduling with non-simultaneous machine available time. Discrete Applied Mathematics, 30(1):53-61.

[6] Lee, C.Y., He, Y., Tang, G.C., 2000. A note on “Parallel machine scheduling with non-simultaneous machine available time”. Discrete Applied Mathematics, 100(1-2):133-135.

[7] Lenstra, J.K., Shmoys, D.B, Tardos, N.E., 1990. Approximation algorithms for scheduling unrelated parallel machines. Mathematical Programming, 46(1-3):259-271.

[8] Lin, G., He, Y., Yao, Y., Lu, H., 1997. Exact bounds of the modified LPT algorithms applying to parallel machines scheduling with non-simultaneous machine available times. Applied Math.-JCU, 12B:109-116.