D. T. Eliiyi and M. Azizo?-glu, 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.
DOI : 10.1016/j.ijpe.2011.03.018

A. Bolat, Procedures for providing robust gate assignments for arriving aircrafts, European Journal of Operational Research, vol.120, issue.1, pp.63-80, 2000.
DOI : 10.1016/S0377-2217(98)00375-0

S. H. Kim, Airport control through intelligent gate assignment, 2013.

J. Guépet, R. Acuna-agost, O. Briant, and J. Gayon, Exact and heuristic approaches to the airport stand allocation problem, European Journal of Operational Research, vol.246, issue.2, pp.597-608, 2015.
DOI : 10.1016/j.ejor.2015.04.040

H. Simonis, Models for Global Constraint Applications, Constraints, vol.14, issue.4, pp.63-92, 2007.
DOI : 10.1007/978-3-540-24664-0_3

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.
DOI : 10.1057/palgrave.jors.2601190

U. I. Gupta, D. T. Lee, and J. Y. Leung, Efficient algorithms for interval graphs and circular-arc graphs, Networks, vol.9, issue.4, pp.459-467, 1982.
DOI : 10.1016/S0022-0000(76)80045-1

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.
DOI : 10.1016/0166-218X(87)90037-0

N. Beldiceanu and E. Contejean, Introducing global constraints in CHIP, Mathematical and Computer Modelling, vol.20, issue.12, pp.97-123, 1994.
DOI : 10.1016/0895-7177(94)90127-9
URL : https://hal.archives-ouvertes.fr/hal-00442810

N. Beldiceanu and M. Carlsson, Sweep as a Generic Pruning Technique Applied to the Non-overlapping Rectangles Constraint, International Conference on Principles and Practice of Constraint Programming, pp.377-391, 2001.
DOI : 10.1007/3-540-45578-7_26

M. Kutz, K. Elbassioni, I. Katriel, and M. Mahajan, Simultaneous matchings: Hardness and approximation, Journal of Computer and System Sciences, vol.74, issue.5, pp.884-897, 2008.
DOI : 10.1016/j.jcss.2008.02.001

M. De-berg, M. Van-kreveld, M. Overmars, and O. Schwarzkopf, Computational Geometry: Algorithms and Applications, 2000.

T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms, 2009.

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-00938018

M. Biró, M. Hujter, and Z. Tuza, Precoloring extension. I. Interval graphs, Discrete Mathematics, vol.100, issue.1-3, pp.267-279, 1992.
DOI : 10.1016/0012-365X(92)90646-W

L. G. Kroon, A. Sen, H. Deng, and A. Roy, The Optimal Cost Chromatic Partition problem for trees and interval graphs, Graph-Theoretic Concepts in Computer Science, pp.279-292, 1997.
DOI : 10.1007/3-540-62559-3_23

F. Lardeux, E. Monfroy, and F. Saubion, Interleaved Alldifferent Constraints: CSP vs. SAT Approaches, Artificial Intelligence: Methodology , Systems, and Applications, pp.380-384, 2008.
DOI : 10.1007/978-3-540-85776-1_34