N. Alon, Y. Azar, G. J. Woeginger, and T. Yadid, Approximation schemes for scheduling on parallel machines, Journal of Scheduling, vol.1, issue.1, pp.55-66, 1998.
DOI : 10.1002/(SICI)1099-1425(199806)1:1<55::AID-JOS2>3.0.CO;2-J

Y. Azar and O. Regev, On-line bin-stretching, Theoretical Computer Science, vol.268, issue.1, pp.17-41, 2001.
DOI : 10.1016/S0304-3975(00)00258-9

E. G. Coffman and G. S. Lueker, Approximation Algorithms for Extensible Bin Packing, Proceedings of the twelfth Annual ACM-SIAM Symposium on Discrete Algorithms, pp.586-588, 2001.
DOI : 10.1007/s10951-006-5594-5

P. Dell-'olmo, H. Kellerer, M. G. Speranza, and Z. Tuza, A approximation algorithm for bin packing with extendable bins, Information Processing Letters, vol.65, issue.5, pp.229-233, 1998.
DOI : 10.1016/S0020-0190(97)00216-0

P. Dell, M. G. Olmo, and . Speranza, Approximation algorithms for partitioning small items in unequal bins to minimize the total size, Discrete Applied Mathematics, vol.94, issue.1-3, pp.181-191, 1999.
DOI : 10.1016/S0166-218X(99)00020-7

L. Epstein, Bin stretching revisited, Acta Informatica, vol.39, issue.2, pp.97-117, 2003.
DOI : 10.1007/s00236-002-0102-7

M. R. Garey and D. S. Johnson, Computers and Intractability: A guide to the Theory of N Pcompleteness, 1979.

R. 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

J. Sgall, On-line scheduling, Lecture Notes in Comput. Sci, vol.1442, pp.196-231, 1998.
DOI : 10.1007/BFb0029570

M. G. Speranza and Z. Tuza, On-line approximation algorithms for scheduling tasks on identical machines with extendable working time, Annals of Operations Research, vol.86, pp.494-506, 1999.

G. J. Woeginger, When does a dynamic programming formulation guarantee the existence of an FP- TAS?, Proceedings of the tenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp.820-829, 1999.

D. Ye and G. Zhang, On-line scheduling with extendable working time on a small number of machines, Information Processing Letters, vol.85, issue.4, pp.171-177, 2003.
DOI : 10.1016/S0020-0190(02)00404-0