E. M. Arkin and E. B. Silverberg, Scheduling jobs with fixed start and end times, Discrete Applied Mathematics, vol.18, issue.1, pp.1-8, 1987.

N. Barnier and P. Brisset, FaCiLe: a Functional Constraint Library, CICLOPS -Colloquium on Implementation of Constraint and LOgic Programming Systems, CP'01 Workshop, 2001.
URL : https://hal.archives-ouvertes.fr/hal-01859902

M. Biró, M. Hujter, and Z. Tuza, Precoloring extension. I. Interval graphs, Discrete Mathematics, vol.100, issue.1, pp.267-279, 1992.

A. Bolat, Procedures for providing robust gate assignments for arriving aircrafts, European Journal of Operational Research, vol.120, issue.1, pp.63-80, 2000.

A. Bolat, Models and a genetic algorithm for static aircraft-gate assignment problem, Journal of the Operational Research Society, vol.52, issue.10, pp.1107-1120, 2001.

Y. Caseau and F. Laburthe, Solving various weighted matching problems with constraints, Principles and Practice of Constraint Programming -CP'97, vol.1330, pp.17-31, 1997.

T. Deniz, M. Eliiyi, and . Azizo?lu, Heuristics for operational fixed job scheduling problems with working and spread time constraints, International Journal of Production Economics, vol.132, issue.1, pp.107-121, 2011.

U. I. Gupta, D. T. Lee, J. Y. , and -. Leung, Efficient algorithms for interval graphs and circular-arc graphs, Networks, vol.12, issue.4, pp.459-467, 1982.

. Llc-gurobi-optimization, Gurobi optimizer reference manual, 2019.

L. G. Kroon, A. Sen, H. Deng, and A. Roy, The optimal cost chromatic partition problem for trees and interval graphs', in Graph-Theoretic Concepts in Computer Science, pp.279-292, 1997.

H. W. Kuhn, The Hungarian method for the assignment problem, Naval Research Logistics Quarterly, vol.2, pp.83-97, 1955.

S. C. Ntafos and S. L. Hakimi, On path cover problems in digraphs and applications to program testing, IEEE Transactions on Software Engineering, SE, vol.5, issue.5, pp.520-529, 1979.

J. Payor, Fast C ++ implementation of the Hungarian algorithm, GitHub repository, 2017.

M. Sellmann, An arc-consistency algorithm for the minimum weight all different constraint', in Principles and Practice of Constraint Programming -CP, pp.744-749, 2002.

H. Springer-berlin,

W. Van-hoeve, Institute for Logic, Language and Computation (ILLC), University of Amsterdam, Operations Research Techniques in Constraint Programming, 2005.

R. Wang and N. Barnier, Propagation of idle times costs for fixed job scheduling, 2018 IEEE 30th International Conference on Tools with Artificial Intelligence (IC-TAI), pp.718-725, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01859777