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, 2010.
DOI : 10.1111/j.1475-3995.2009.00758.x

P. Brucker and S. Knust, Complexity Results for Single-Machine Problems with Positive Finish-Start Time-Lags, Computing, vol.63, issue.4, pp.299-316, 1999.
DOI : 10.1007/s006070050036

T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms, 2 edn, 2001.

B. Dupont-de-dinechin, Scheduling monotone interval orders on typed task systems, 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

M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP- Completeness, 1979.

C. Hanen and Y. Zinder, The worst case analysis of garey-johnson algorithm for preemptive m processors, Multidisciplinary International Conference on Scheduling: Theory and Applications, pp.453-470, 2005.
URL : https://hal.archives-ouvertes.fr/hal-01420471

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

J. L. Hennessy and T. Gross, Postpass Code Optimization of Pipeline Constraints, ACM Transactions on Programming Languages and Systems, vol.5, issue.3, pp.422-448, 1983.
DOI : 10.1145/2166.357217

W. Horn, Some simple scheduling algorithms, Naval Research Logistics Quarterly, vol.18, issue.1, pp.177-185, 1974.
DOI : 10.1002/nav.3800210113

A. M. Kordon, F. Kacem, B. Dupont-de-dinechin, and L. Finta, Scheduling an interval ordered precedence graph with communication delays and a limited number of processors, RAIRO - Operations Research, vol.47, issue.1, pp.73-87, 2013.
DOI : 10.1051/ro/2013028
URL : https://hal.archives-ouvertes.fr/hal-01195937

J. Lenstra, A. R. Kan, and P. Brucker, Complexity of Machine Scheduling Problems, Studies in Integer Programming, pp.343-362, 1977.
DOI : 10.1016/S0167-5060(08)70743-X

K. V. Palem and B. B. Simons, Scheduling time-critical instructions on RISC machines, ACM Transactions on Programming Languages and Systems, vol.15, issue.4, pp.632-658, 1993.
DOI : 10.1145/155183.155190
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.1033.1930

J. D. Ullman, NP-complete scheduling problems, Journal of Computer and System Sciences, vol.10, issue.3, pp.384-393, 1975.
DOI : 10.1016/S0022-0000(75)80008-0
URL : http://doi.org/10.1016/s0022-0000(75)80008-0

W. Yu, H. Hoogeveen, and J. K. Lenstra, 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