J. Arnaout, G. Rabadi, and R. Musa, A two-stage ant colony optimisation algorithm to monomize the makespan of unrelated parallel machines with sequencedependent setup times, Journal of Intelligent Manufacturing, 2009.

J. Blazewicz, K. H. Ecker, E. Pesch, G. Schmidt, and J. Weglarz, Scheduling computer and manufacturing processes, 1996.
DOI : 10.1038/sj.jors.2600793

P. Brucker, Scheduling algorithms, 2004.

M. Ghirardi and C. N. Potts, Makespan minimization for scheduling unrelated parallel machines: A recovering beam search approach, European Journal of Operational Research, vol.165, issue.2, pp.457-467, 2005.
DOI : 10.1016/j.ejor.2004.04.015

C. Lee and M. Pinedo, Optimization and heuristics of scheduling, Handbook of applied optimization, 2002.

S. Martello, F. Soumis, and P. Toth, Exact and approximation algorithms for makespan minimization on unrelated parallel machines, Discrete Applied Mathematics, vol.75, issue.2, pp.169-188, 1997.
DOI : 10.1016/S0166-218X(96)00087-X
URL : https://doi.org/10.1016/s0166-218x(96)00087-x

E. Mokotoff, Parallel machine scheduling problems: A survey, Asia-Pacific Journal of Operational Research, vol.18, issue.2, pp.193-242, 2001.

E. Mokotoff and P. Chretienne, A cutting plane algorithm for the unrelated parallel machine scheduling problem, European Journal of Operational Research, vol.141, issue.3, pp.515-525, 2002.
DOI : 10.1016/S0377-2217(01)00270-3
URL : https://hal.archives-ouvertes.fr/hal-01185792

E. Mokotoff and J. L. Jimeno, Heuristics based on partial enumeration for the unrelated parallel processor scheduling problem, Annals of Operations Research, vol.117, pp.1-4133, 2002.

M. Pinedo, Scheduling: Theory, Algorithms, and Systems, 2002.

E. Shchepin and N. Vakhania, An absolute approximation algorithm for scheduling unrelated machines, Naval Research Logistics, vol.33, issue.6, pp.502-507, 2006.
DOI : 10.1002/nav.20157

E. V. Shchepin and N. Vakhania, An optimal rounding gives a better approximation for scheduling unrelated machines, Operations Research Letters, vol.33, issue.2, pp.127-133, 2005.
DOI : 10.1016/j.orl.2004.05.004