W. Bo?-zejko and M. Wodecki, On the theoretical properties of swap multimoves, Operations Research Letters, pp.227-231, 2006.

W. Bo?-zejko 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?-zejko and M. Wodecki, Parallel genetic algorithm for minimizing total weighted completion time, Lecture Notes in Artificial Intelligence, vol.3070, pp.400-405, 2004.

K. Bulbul, A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem, Computers & Operations Research, vol.38, issue.6, pp.967-983, 2011.
DOI : 10.1016/j.cor.2010.09.015

C. Ellrod, Load Balancing ? Least Connections, https://www.citrix.com/blogs, 2010.

Y. K. Lin and C. S. Chong, A tabu search algorithm to minimize total weighted tardiness for the job shop scheduling problem, Journal of Industrial and Management Optimization, vol.12, issue.2, pp.703-713, 2016.
DOI : 10.3934/jimo.2016.12.703

P. Mell and T. Grance, The NIST definition of cloud computing, Recommendations of the National Institute of Standards and Technology

F. Wu, Q. Wu, and T. Yousong, Workflow scheduling in cloud: a survey, The Journal of Supercomputing, vol.10, issue.8, pp.2015-3373
DOI : 10.1109/71.790598

M. Wodecki, A branch-and-bound parallel algorithm for single-machine total weighted tardiness problem, The International Journal of Advanced Manufacturing Technology, vol.2328, issue.3, pp.996-1004, 2008.
DOI : 10.1287/opre.33.2.363

M. Wodecki, A block approach to earliness-tardiness scheduling problems, The International Journal of Advanced Manufacturing Technology, vol.52, issue.2, pp.797-807, 2009.
DOI : 10.1007/978-3-662-04986-0