J. B?a?ewicz, M. Drabowski, and J. W?glarz, Scheduling multiprocessor tasks to minimize schedule length, IEEE Transactions on Computers, vol.35, issue.5, pp.389-393, 1986.

I. B??dek, M. Drozdowski, F. Guinand, and X. Schepler, On contiguous and non-contiguous parallel task scheduling, Journal of Scheduling, vol.16, issue.2, pp.487-495, 2015.
DOI : 10.1016/0167-8191(90)90056-F

G. Bozoki and J. Richard, A branch-and-bound algorithm for thecontinous-process job-shop scheduling problem, AIIE Transactions, vol.23, pp.246-252, 1970.

W. Bo?ejko and M. Wodecki, On the theoretical properties of swap multimoves, Operations Research Letters, vol.35, issue.2, pp.227-231, 2006.
DOI : 10.1016/j.orl.2006.03.002

W. Bo?ejko, ?. Gniewkowski, and M. Wodecki, Solving Timetabling Problems on GPU, Lecture Notes in Artificial Intelligence No, vol.8468, pp.445-455, 2014.
DOI : 10.1007/978-3-319-07176-3_39

W. Bo?ejko and M. Wodecki, Solving permutational routing problems by population-based metaheuristics, Computers & Industrial Engineering, vol.57, issue.1, pp.269-276, 2009.
DOI : 10.1016/j.cie.2008.11.022

W. Bo?ejko and M. Wodecki, Parallel Genetic Algorithm for the Flow Shop Scheduling Problem, Lecture Notes in Computer Science No, vol.3019, pp.566-571, 2004.
DOI : 10.1007/978-3-540-24669-5_74

M. Drozdowski, Scheduling multiprocessor tasks ??? An overview, European Journal of Operational Research, vol.94, issue.2, pp.215-230, 1996.
DOI : 10.1016/0377-2217(96)00123-3
URL : http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.159.1883&rep=rep1&type=pdf

M. Drozdowski, Select problems of scheduling tasks in multiprocessor computer system, 1997.

M. Drozdowski, Scheduling for parallel Processing, Computer Communications and Network, 2009.
DOI : 10.1007/978-1-84882-310-5

D. G. Feitelson, L. Rudolph, U. Schwiegelshohn, K. C. Sevcik, and P. Wang, Theory and practice in parallel job scheduling, Lecture Notes in Computer Science No, vol.1291, pp.1-34, 1997.
DOI : 10.1007/3-540-63574-2_14

M. R. Garey and D. S. Johnson, Computers and intractability: a guide to the theory of NP-completeness, 1979.

A. Kramer, Scheduling multiprocessor tasks on dedicated processors. PhDThesis, Fachbereich Mathematik/Informatik, 1995.

C. Y. Lee and X. Cai, Scheduling one and two-processor tasks on two parallel processors, IIE Transactions, vol.9, issue.5, pp.445-455, 1999.
DOI : 10.1287/moor.17.1.22

J. Lin and S. Chen, Scheduling algorithm for nonpreemptive multiprocessor tasks, Computers & Mathematics with Applications, vol.28, issue.4, pp.85-92, 1994.
DOI : 10.1016/0898-1221(94)00129-4
URL : https://doi.org/10.1016/0898-1221(94)00129-4

E. Lloyd, Concurrent Task Systems, Operations Research, vol.29, issue.1, pp.189-201, 1981.
DOI : 10.1287/opre.29.1.189

C. Smutnicki, J. Pempera, J. Rudy, and D. ?elazny, A new approach for multi-criteria scheduling, Computers & Industrial Engineering, vol.90, pp.212-220, 2015.
DOI : 10.1016/j.cie.2015.09.003

V. Vizing, About schedules observing deadlines, pp.128-135, 1981.