F. Chauvet, E. Levner, L. Meyzin, and J. Proth, On-line scheduling in a surface treatment system, European Journal of Operational Research, vol.120, issue.2, 2000.
DOI : 10.1016/S0377-2217(98)00376-2
URL : https://hal.archives-ouvertes.fr/inria-00073371

F. Chauvet, Constrained Work-In-Process in On-line Scheduling, 1999.

B. Chen and G. J. Woeginger, A Study of On-Line Scheduling Two-Stage Shops, Minimax and Applications, pp.97-107, 1995.
DOI : 10.1007/978-1-4613-3557-3_6

L. R. Ford and . Jr, Network flow theory. The Rand Corporation, p.293, 1956.

P. C. Gilmore and R. E. Gomory, Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem, Operations Research, vol.12, issue.5, pp.655-679, 1964.
DOI : 10.1287/opre.12.5.655

S. K. Goyal and C. Sriskandarajah, No-Wait Shop Scheduling: Computational Complexity and Approximate Algorithms, Operations Research, vol.25, issue.4, pp.220-244, 1988.

N. G. Hall and C. Sriskandarajah, A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process, Operations Research, vol.44, issue.3, pp.510-525, 1996.
DOI : 10.1287/opre.44.3.510

D. G. Malcolm, J. H. Roseboom, C. E. Clark, and W. Fazar, Application of a Technique for Research and Development Program Evaluation, Operations Research, vol.7, issue.5, 1959.
DOI : 10.1287/opre.7.5.646

H. Röck, The Three-Machine No-Wait Flow Shop Problem is NP-Complete Journal of the Association of, Computer Machine, vol.51, pp.336-345, 1984.

H. Röck, Some new results in flow shop scheduling, Zeitschrift f??r Operations Research, vol.45, issue.1, pp.1-16, 1984.
DOI : 10.1007/BF01919082

S. Sahni and Y. Cho, Complexity of Scheduling Shops with No Wait in Process, Mathematics of Operations Research, vol.4, issue.4, pp.448-457, 1979.
DOI : 10.1287/moor.4.4.448