P. Brucker, Scheduling Algorithms, 2007.

G. Csardi and T. Nepusz, The igraph software package for complex network research, InterJournal Complex Systems, p.1695, 2006.

R. P. Dick, D. L. Rhodes, and W. Wolf, TGFF, Proceedings of the sixth international workshop on Hardware/software codesign , CODES/CASHE '98, pp.97-101, 1998.
DOI : 10.1145/278241.278309

P. Erd?-os and A. Rényi, On random graphs I, Publicationes Mathematicae Debrecen, vol.6, pp.290-297, 1959.

D. Feitelson, Workload characterization and modeling book, 2005.

D. Feitelson, The parallel workloads archive logs, 2009.

E. R. Gansner and S. C. North, An open graph visualization system and its applications to software engineering. Software: Practice and Experience, pp.1203-1233, 2000.

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

B. Gough, GNU Scientific Library Reference Manual). Network Theory Ltd, 2009.

R. L. Graham, Bounds on Multiprocessing Timing Anomalies, SIAM Journal on Applied Mathematics, vol.17, issue.2, pp.416-429, 1969.
DOI : 10.1137/0117039
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.90.8131

A. A. Hagberg, D. A. Schult, and P. J. Swart, Exploring network structure, dynamics, and function using NetworkX, Proceedings of the 7th Python in Science conference, pp.11-15, 2008.

D. E. Knuth, The Stanford GraphBase: a platform for combinatorial computing, 1993.

J. G. Siek, L. Lee, and A. Lumsdaine, The Boost Graph Library: User Guide and Reference Manual, 2002.

N. J. Sloane and S. Plouffe, The Encyclopedia of Integer Sequences, 1995.

T. Tobita and H. Kasahara, A standard task graph set for fair evaluation of multiprocessor scheduling algorithms, Journal of Scheduling, vol.70, issue.5, pp.379-394, 2002.
DOI : 10.1002/jos.116

P. Winkler, Random orders. Order, pp.317-331, 1985.
DOI : 10.1007/bf00582738