A. Ahmeti and N. Musliu, Min-conflicts heuristic for multi-mode resource-constrained projects scheduling, Proceedings of the Genetic and Evolutionary Computation Conference, pp.237-244, 2018.

A. Angulo, D. Espinoza, and R. Palma, Thermal unit commitment instances for paper: A polyhedral-based approach applied to quadratic cost curves in the unit commitment problem

D. Applegate and W. Cook, A computational study of the job-shop scheduling problem, ORSA Journal on Computing, vol.3, pp.149-156, 1991.

J. Beck, T. Feng, and J. P. Watson, Combining constraint programming and local search for job-shop scheduling, INFORMS Journal on Computing, vol.23, pp.1-14, 2011.

T. Benoist, B. Estellon, F. Gardi, R. Megel, and K. Nouioua, Localsolver 1.x: A black-box local-search solver for 0-1 programming, vol.9, pp.299-316, 2011.

J. Ding, L. Shen, Z. Lü, and B. Peng, Parallel machine scheduling with completion-time-based criteria and sequence-dependent deterioration, Computers & Operations Research, vol.103, pp.35-45, 2019.

N. Dupin and E. G. Talbi, Parallel matheuristics for the discrete unit commitment problem with min-stop ramping constraints, International Transactions in Operational Research, vol.27, issue.1, pp.219-244, 2020.
URL : https://hal.archives-ouvertes.fr/hal-02304758

S. Even, A. Itai, and A. Shamir, On the complexity of timetable and multicommodity flow problems, SIAM J. Comput, vol.5, pp.691-703, 1976.

H. Fisher and G. Thompson, Probabilistic learning combinations of local job-shop scheduling rules, 1963.

F. Gardi, T. Benoist, J. Darlay, B. Estellon, and R. Megel, Mathematical Programming Solver Based on Local Search, 2014.

F. Glover, Ejection chains, reference structures and alternating path methods for traveling salesman problems, Discrete Applied Mathematics, vol.65, issue.1, pp.223-253, 1996.

D. Grimes, E. Hebrard, and A. Malapert, Principles and Practice of Constraint Programming -CP 2009, pp.400-408, 2009.

S. Lawrence, Resource-constrained project scheduling: an experimental investigation of heuristic scheduling techniques (supplement). Tech. rep., Graduate School of Industrial Administration, 1984.

S. Minton, M. D. Johnston, A. B. Philips, and P. Laird, Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems, Artificial Intelligence, vol.58, issue.1, pp.161-205, 1992.

B. Peng, Z. Lü, and T. Cheng, A tabu search/path relinking algorithm to solve the job shop scheduling problem, Computers & Operations Research, vol.53, pp.154-164, 2015.

M. Siala, C. Artigues, and E. Hebrard, Two clause learning approaches for disjunctive scheduling. In: Principles and Practice of Constraint Programming, pp.393-402, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01229050

E. Taillard, Benchmarks for basic scheduling problems, European Journal of Operational Research, vol.64, issue.2, pp.278-285, 1993.

R. Vaessens, E. Aarts, and J. Lenstra, Job shop scheduling by local search. Computing science notes, 1994.

J. Zhang, G. Ding, Y. Zou, S. Qin, and J. Fu, Review of job shop scheduling research and its new perspectives under industry 4.0, Journal of Intelligent Manufacturing, 2017.