A. Benabid and C. Hanen, Performance of Garey-Johnson algorithm for pipelined typed tasks systems, International Transactions in Operational Research, vol.81, issue.3, pp.797-808, 2009.
DOI : 10.1111/j.1475-3995.2009.00758.x

A. Benabid and C. Hanen, Minimizing lateness for precedence graphs with constant delays on dedicated pipelined processors, Electronic Notes in Discrete Mathematics, vol.36, pp.791-798, 2010.
DOI : 10.1016/j.endm.2010.05.100
URL : https://hal.archives-ouvertes.fr/hal-01185246

B. Dupont-de-dinechin, Scheduling Monotone Interval Orders on Typed Task Systems, PLANSIG 2007, 26th Worshop of the UK Planning and Scheduling Special Interest Group, pp.25-31, 2007.

M. R. Garey and D. S. Johnson, Two-Processor Scheduling with Start-Times and Deadlines, SIAM Journal on Computing, vol.6, issue.3, pp.416-426, 1977.
DOI : 10.1137/0206029
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.134.6468

C. Hanen and Y. Zinder, Scheduling UET-UCT Task Systems under the Out-forest precedence constraints, Multidisciplinary International Conference on Scheduling: Theory and Applications, pp.445-452, 2005.
URL : https://hal.archives-ouvertes.fr/hal-01420461

C. Hanen and Y. Zinder, The worst-case analysis of the Garey???Johnson algorithm, Journal of Scheduling, vol.22, issue.4, pp.389-400, 2009.
DOI : 10.1007/s10951-009-0101-4
URL : https://hal.archives-ouvertes.fr/hal-01185248

A. Leung, K. V. Palem, and A. Pnueli, Scheduling time-constrained instructions on pipelined processors, ACM Transactions on Programming Languages and Systems, vol.23, issue.1, pp.73-103, 2001.
DOI : 10.1145/383721.383733

A. Munier-kordon, K. Fadi, B. Dupont-de-dinechin, and L. Finta, Scheduling an interval ordered precedence graph with communication delays and a limited number of processors, 2011.
URL : https://hal.archives-ouvertes.fr/hal-01195937