E. Angelelli, Semi on-line scheduling on two parallel processors with known sum and lower bound on the size of the tasks, CEJOR, vol.8, pp.285-295, 2000.

E. Angelelli, M. G. Speranza, . Zs, and . Tuza, Semi-On-line Scheduling on Two Parallel Processors with an Upper Bound on the Items, Algorithmica, vol.29, issue.4, pp.37-243, 2003.
DOI : 10.1007/s00453-003-1037-2

Y. Bartal, A. Fiat, H. Karloff, and R. Vohra, New algorithms for an ancient scheduling problem, J. Comput. Sys. Sci, pp.51-359, 1995.

U. Faigle, W. Kern, . Gy, and . Turán, On the performance of on-line algorithms for particular problems, Acta Cybernetica, vol.9, pp.107-119, 1989.

R. L. Graham, Bounds for Certain Multiprocessing Anomalies, Bell System Technical Journal, vol.45, issue.9, pp.1563-1581, 1966.
DOI : 10.1002/j.1538-7305.1966.tb01709.x

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

H. Kellerer, V. Kotov, M. G. Speranza, . Zs, and . 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

D. Sleator and R. E. Tarjan, Amortized efficiency of list update and paging rules, Communications of the ACM, vol.28, issue.2, pp.202-208, 1985.
DOI : 10.1145/2786.2793