A. Borodin, S. Irani, P. Raghavan, and B. Schieber, Competitive Paging with Locality of Reference, Journal of Computer and System Sciences, vol.50, issue.2, pp.244-258, 1995.
DOI : 10.1006/jcss.1995.1021

B. Chen, A. Van-vliet, and G. J. Woeginger, An optimal algorithm for preemptive on-line scheduling, Operations Research Letters, vol.18, issue.3, pp.127-131, 1995.
DOI : 10.1016/0167-6377(95)00039-9

D. Du, Optimal preemptive semi-online scheduling on two uniform processors, Information Processing Letters, vol.92, issue.5, pp.219-223, 2004.
DOI : 10.1016/j.ipl.2004.09.003

T. Ebenlendr, W. Jawor, and J. Sgall, Preemptive Online Scheduling: Optimal Algorithms for All Speeds, Proc. 13th European Symp. on Algorithms (ESA), pp.327-339, 2006.
DOI : 10.1007/11841036_31

T. Ebenlendr and J. Sgall, Optimal and Online Preemptive Scheduling on Uniformly Related Machines, Proc. 21st Symp. on Theoretical Aspects of Computer Science (STACS), pp.199-210, 2004.
DOI : 10.1007/978-3-540-24749-4_18
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.11.2649

L. Epstein and L. M. Favrholdt, Optimal preemptive semi-online scheduling to minimize makespan on two related machines, Operations Research Letters, vol.30, issue.4, pp.269-275, 2002.
DOI : 10.1016/S0167-6377(02)00179-7

L. Epstein and J. Sgall, A lower bound for on-line scheduling on uniformly related machines, Operations Research Letters, vol.26, issue.1, pp.17-22, 2000.
DOI : 10.1016/S0167-6377(99)00062-0

T. F. Gonzales and S. Sahni, Preemptive Scheduling of Uniform Processor Systems, Journal of the ACM, vol.25, issue.1, pp.92-101, 1978.
DOI : 10.1145/322047.322055

Y. He and G. Zhang, Semi On-Line Scheduling on Two Identical Machines, Computing, vol.62, issue.3, pp.179-187, 1999.
DOI : 10.1007/s006070050020

E. Horwath, E. C. Lam, and R. Sethi, A Level Algorithm for Preemptive Scheduling, Journal of the ACM, vol.24, issue.1, pp.32-43, 1977.
DOI : 10.1145/321992.321995

Y. Jiang and Y. He, Optimal semi-online algorithms for preemptive scheduling problems with inexact partial information, Acta Informatica, vol.23, issue.7-8, pp.571-590, 2007.
DOI : 10.1007/s00236-007-0058-8

H. Kellerer, V. Kotov, M. G. Speranza, and Z. Tuza, Semi on-line algorithms for the partition problem, Operations Research Letters, vol.21, issue.5, pp.235-242, 1997.
DOI : 10.1016/S0167-6377(98)00005-4

S. Seiden, J. Sgall, and G. J. Woeginger, Semi-online scheduling with decreasing job sizes, Operations Research Letters, vol.27, issue.5, pp.215-221, 2000.
DOI : 10.1016/S0167-6377(00)00053-5
URL : http://bit.csc.lsu.edu/~seiden/ordered6.ps.Z

Z. Tan and Y. He, Semi-on-line problems on two identical machines with combined partial information, Operations Research Letters, vol.30, issue.6, pp.408-414, 2002.
DOI : 10.1016/S0167-6377(02)00164-5

Z. Tan and Y. He, Semi-online scheduling problems on two identical machines with inexact partial information, Theoretical Computer Science, vol.377, issue.1-3, pp.110-125, 2007.
DOI : 10.1016/j.tcs.2007.02.014
URL : http://doi.org/10.1016/j.tcs.2007.02.014