B. P. Hilbig-t and H. J. , A branch and bound algorithm for a singlemachine scheduling problem with positive and negative time-lags, Discrete Applied Mathematics, vol.94, pp.77-99, 1999.

C. H. , D. R. Et, and S. M. , A heuristic algorithm for the n job, m machine sequencing problem, Management Science, vol.16, pp.10-630, 1970.

C. J. Et and C. P. , Problèmes d'ordonnancement : modélisation / complexité / algorithmes, 1988.

G. Gilmore, 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

I. E. Et and S. E. , Application of the branch and bound technique to some flow-shop scheduling problems, Operations Research, vol.13, p.13, 1965.

N. M. Enscore-jr and H. I. Et, A heuristic algorithm for the m machine , n-job flow shop sequencing problem, Omega, p.11, 1983.