Ordonnancement d'atelier avec contraintes temporelles entre oprations, 2004. ,
Permutation flowshop scheduling problems with maximal and minimal time lags, Computers & Operations Research, vol.33, issue.6 ,
DOI : 10.1016/j.cor.2004.11.006
URL : https://hal.archives-ouvertes.fr/inria-00100091
Minimizing Makespan in a Two-Machine Flow Shop with Delays and Unit-Time Operations is NP-Hard, Journal of Scheduling, vol.7, issue.5, pp.333-348, 2004. ,
DOI : 10.1023/B:JOSH.0000036858.59787.c2