A. Coles and A. Coles, LPRPG-P: Relaxed plan heuristics for planning with preferences, Proc. ICAPS'11, 2011.

A. Coles, M. Fox, D. Long, and A. Smith, A hybrid relaxed planning graph -LP heuristic for numeric planning domains, Proc. ICAPS'08, pp.52-59, 2008.

A. Coles, M. Fox, and A. Smith, A new localsearch algorithm for forward-chaining planning, Proc. ICAPS'07, pp.89-96, 2007.

C. Domshlak, E. Karpas, and S. Markovitch, To max or not to max: Online learning for speeding up optimal planning, Proc. AAAI'10, pp.1071-1076, 2010.

F. Dvorak and R. Barták, Integrating Time and Resources into Planning, 2010 22nd IEEE International Conference on Tools with Artificial Intelligence, pp.71-78, 2010.
DOI : 10.1109/ICTAI.2010.86

S. Edelkamp, Taming numbers and durations in the model checking integrated planning system, JAIR, vol.20, pp.195-238, 2003.

S. Edelkamp, Generalizing the Relaxed Planning Heuristic to Non-linear Tasks, Proc. KI'04, pp.198-212, 2004.
DOI : 10.1007/978-3-540-30221-6_16

C. Fawcett, M. Helmert, H. Hoos, E. Karpas, G. Röger et al., FD-Autotune: Automated configuration of Fast Downward, 2011.

M. Fox and D. Long, PDDL2.1: An extension to PDDL for expressing temporal planning domains, JAIR, vol.20, pp.61-124, 2003.

A. Gerevini, A. Saetti, and I. Serina, Planning through stochastic local search and temporal action graphs, JAIR, vol.20, pp.239-290, 2003.

A. Gerevini, A. Saetti, and I. Serina, An approach to efficient planning with numerical fluents and multi-criteria plan quality, Artificial Intelligence, vol.172, issue.8-9, pp.899-944, 2008.
DOI : 10.1016/j.artint.2008.01.002

P. Haslum and H. Geffner, Heuristic planning with time and resources, Proc. ECP'01, pp.121-132, 2001.

I. Heckman and J. C. Beck, Understanding the behavior of Solution-Guided Search for??job-shop scheduling, Journal of Scheduling, vol.143, issue.2, pp.121-140, 2011.
DOI : 10.1007/s10951-009-0113-0

M. Helmert and C. Domshlak, Landmarks, critical paths and abstractions: What's the difference anyway?, Proc. ICAPS'09, pp.162-169, 2009.

M. Helmert, P. Haslum, and J. Hoffmann, Flexible abstraction heuristics for optimal sequential planning, Proc. ICAPS'07, pp.176-183, 2007.

M. Helmert, The Fast Downward planning system, JAIR, vol.26, pp.191-246, 2006.

J. Hoffmann and B. Nebel, The FF planning system: Fast plan generation through heuristic search, JAIR, vol.14, pp.253-302, 2001.

J. Hoffmann, H. Kautz, C. Gomes, and B. Selman, SAT encodings of state-space reachability problems in numeric domains, Proc. IJCAI'07, 1918.

J. Hoffmann, The Metric-FF planning system: Translating " ignoring delete lists " to numeric state variables, JAIR, vol.20, pp.291-341, 2003.

J. Koehler, Planning under resource constraints, Proc. ECAI'98, pp.489-493, 1998.

H. Nakhost and M. Müller, Monte-Carlo exploration for deterministic planning, Proc. IJCAI'09, pp.1766-1771, 2009.

H. Nakhost, J. Hoffmann, and M. Müller, Improving local search for resource-constrained planning, SOCS-10, pp.81-82, 2010.
URL : https://hal.archives-ouvertes.fr/inria-00491129

R. Nissim, J. Hoffmann, and M. Helmert, Computing perfect heuristics in polynomial time: On bisimulation and merge-and-shrink abstraction in optimal planning, Proc. IJCAI'11, 1983.
URL : https://hal.archives-ouvertes.fr/inria-00592438

S. Richter, M. Helmert, and M. Westphal, Landmarks revisited, Proc. AAAI'08, pp.975-982, 2008.

J. Rintanen, Heuristics for Planning with SAT, Proc. CP'10, pp.414-428, 2010.
DOI : 10.1007/978-3-642-15396-9_34