R. Dechter, I. Meiri, and J. Pearl, Temporal constraint networks, Temporal constraint networks, pp.61-95, 1991.
DOI : 10.1016/0004-3702(91)90006-6

K. Stergiou and M. Koubarakis, Backtracking algorithms for disjunctions of temporal constraints, Artificial Intelligence, vol.120, issue.1, pp.81-117, 2000.
DOI : 10.1016/S0004-3702(00)00019-9

R. Challenge, Handling the mission of Earth observation satellites, 2003.

M. Lemaître, G. Verfaillie, F. Jouhaud, J. M. Lachiver, and N. Bataille, Selecting and scheduling observations of agile satellites, Aerospace Science and Technology, vol.6, issue.5, pp.367-381, 2002.
DOI : 10.1016/S1270-9638(02)01173-2

T. Cheng, Q. Ding, and B. Lin, A concise survey of scheduling with time-dependent processing times, European Journal of Operational Research, vol.152, issue.1, pp.1-13, 2004.
DOI : 10.1016/S0377-2217(02)00909-8

S. Gawiejnowicz, Time-dependent scheduling, 2008.

R. Cervoni, A. Cesta, and A. Oddi, Managing dynamic temporal constraint networks, Proc. of AIPS-94, pp.13-18, 1994.

A. Cesta and A. Oddi, Gaining efficiency and flexibility in the simple temporal problem, Proceedings Third International Workshop on Temporal Representation and Reasoning (TIME '96), pp.45-50, 1996.
DOI : 10.1109/TIME.1996.555676

A. Gerevini, A. Perini, and F. Ricci, Incremental algorithms for managing temporal constraints, Proceedings Eighth IEEE International Conference on Tools with Artificial Intelligence, pp.360-365, 1996.
DOI : 10.1109/TAI.1996.560477

I. Shu, R. Effinger, and B. Williams, Enabling fast flexible planning through incremental temporal reasoning with conflict extraction, Proc. of ICAPS-05, pp.252-261, 2005.

L. Xu and B. Choueiry, A new efficient algorithm for solving the simple temporal problem, Proc. of TIME-ICTL-03, pp.210-220, 2003.

L. Planken, M. De-weerdt, and R. Van-der-krogt, P3C: a new algorithm for the simple temporal problem, Proc. of ICAPS-08, pp.256-263, 2008.

L. Planken, M. De-weerdt, and N. Yorke-smith, Incrementally solving STNs by enforcing partial path consistency, Proc. of ICAPS-10, pp.129-136, 2010.

U. Montanari, Networks of constraints: Fundamental properties and applications to picture processing, Information Sciences, vol.7, issue.2, pp.95-132, 1974.
DOI : 10.1016/0020-0255(74)90008-5

P. V. Hentenryck, Y. Deville, and C. Teng, A generic arc-consistency algorithm and its specializations, Artificial Intelligence, vol.57, issue.2-3, pp.291-321, 1992.
DOI : 10.1016/0004-3702(92)90020-X

M. Bender, R. Cole, E. Demaine, M. Farach-colton, and J. Zito, Two Simplified Algorithms for Maintaining Order in a List, Proc. of ESA-02, pp.152-164, 2002.
DOI : 10.1007/3-540-45749-6_17

B. Haeupler, T. Kavitha, R. Mathew, S. Sen, and R. Tarjan, Incremental Cycle Detection, Topological Ordering, and Strong Component Maintenance, ACM Transactions on Algorithms, vol.8, issue.1, 2012.
DOI : 10.1145/2071379.2071382

URL : http://arxiv.org/abs/1105.2397

L. Roditty and U. Zwick, Improved Dynamic Reachability Algorithms for Directed Graphs, SIAM Journal on Computing, vol.37, issue.5, pp.1455-1471, 2008.
DOI : 10.1137/060650271

P. V. Hentenryck and L. Michel, Constraint-based local search, 2005.

T. Benoist, B. Estellon, F. Gardi, R. Megel, and K. Nouioua, LocalSolver 1.x: a black-box local-search solver for 0-1 programming, 4OR, vol.20, issue.2, pp.299-316, 2011.
DOI : 10.1007/s10288-011-0165-9