[16] Herroelen, W., De Reyck, B., and Demeulemeester, E. Resourceconstrained project scheduling: A survey of recent developments. Computers &
Operations Research 25, 4 (1998), 279–302.

[17] Horbach, A. A boolean satisfiability approach to the resource-constrained project scheduling problem. *Annals of Operations Research To appear* (2010), To appear.

[18] Kolisch, R., Schwindt, C., and Sprecher, A. *Project Scheduling: Recent Models, Algorithms and Applications*. Kluwer Academic Publishers, 1998, ch. Benchmark instances for project scheduling problems, pp. 197–212.

[19] Le Pape, C. Implementation of resource constraints in ILOG Schedule: A library for the development of constraint-based scheduling systems. *Intelligent Systems* Engineering 3, 2 (1994), 55–66.

[20] Marriott, K., Nethercote, N., Rafeh, R., Stuckey, P. J., Garcia de la Banda, M., and Wallace, M. G. The design of the zinc modelling language.

Constraints 13, 3 (Sept. 2008), 229–267.

[21] Moskewicz, M. W., Madigan, C. F., Zhao, Y., Zhang, L., and Malik, S.

Chaff: Engineering an efficient SAT solver. In *Design Automation Conference* (New York, NY, USA, 2001), ACM, pp. 530–535.

[22] Neumann, K., and Schwindt, C. Activity-on-node networks with minimal and maximal time lags and their application to make-to-order production. *OR Spectrum* 19 (1997), 205–217. 10.1007/BF01545589.

[23] Oddi, A., and Rasconi, R. Iterative flattening search on rcpsp/max problems:
Recent developments. In *Recent Advances in Constraints*, A. Oddi, F. Fages, and F. Rossi, Eds., vol. 5655 of *Lecture Notes in Computer Science*. Springer Berlin / Heidelberg, 2009, pp. 99–115. 10.1007/978-3-642-03251-6 7.

[24] Ohrimenko, O., Stuckey, P. J., and Codish, M. Propagation via lazy clause generation. *Constraints 14*, 3 (2009), 357–391.

[25] Schulte, C., and Stuckey, P. J. Efficient constraint propagation engines. ACM
Transactions on Programming Languages and Systems 31, 1 (2008), 1–43. Article No. 2.

[26] Schutt, A., Feydy, T., Stuckey, P. J., and Wallace, M. G. Why cumulative decomposition is not as bad as it sounds. In Proceedings of the 15th International Conference on Principles and Practice of Constraint Programming (2009), I. Gent, Ed., vol. 5732 of *LNCS*, Springer-Verlag, pp. 746–761.

[27] Schutt, A., Feydy, T., Stuckey, P. J., and Wallace, M. G. Explaining the cumulative propagator. *Constraints To appear* (2010), 1–33.