[4] Ballest´ın, F., Barrios, A., and Valls, V. An evolutionary algorithm for the resource-constrained project scheduling problem with minimum and maximum time lags. *Journal of Scheduling To appear.* (2009), 1–16. 10.1007/s10951-009-0125-9.

[5] Bartusch, M., Mohring, R. H., and Radermacher, F. J. ¨ Scheduling project networks with resource constraints and time windows. *Annals of Operations Research 16*, 1 (dec 1988), 199–240.

[6] Bellman, R. On a routing problem. *Quarterly of Applied Mathematics 16*, 1
(1958), 87–90.

[7] Blazewicz, J., Lenstraand, J. K., and Rinnooy Kan, A. H. G. Scheduling subject to resource constraints: classification and complexity. *Discrete Applied* Mathematics 5 (1983), 11–24.

[8] Brucker, P., Drexl, A., Mohring, R., Neumann, K., and Pesch, E. ¨
Resource-constrained project scheduling: Notation, classification, models, and methods. *European Journal of Operational Research 112*, 1 (1999), 3–41.

[9] Cesta, A., Oddi, A., and Smith, S. F. A constraint-based method for project scheduling with time windows. *Journal of Heuristics 8*, 1 (2002), 109–136.

[10] De Reyck, B., and Herroelen, W. A branch-and-bound procedure for the resource-constrained project scheduling problem with generalized precedence relations. *European Journal of Operational Research 111*, 1 (1998), 152–174.

[11] Dorndorf, U., Pesch, E., and Phan-Huy, T. A time-oriented branch-andbound algorithm for resource-constrained project scheduling with generalised precedence constraints. *Manage. Sci. 46*, 10 (2000), 1365–1384.

[12] Fest, A., Mohring, R. H., Stork, F., and Uetz, M. ¨ Resource-constrained project scheduling with time windows: A branching scheme based on dynamic release dates. Tech. Rep. 596, Technische Universit¨at Berlin, 1999.

[13] Feydy, T., Schutt, A., and Stuckey, P. J. Global difference constraint propagation for finite domain solvers. In PPDP '08: Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming (New York, NY, USA, 2008), ACM, pp. 226–235. To appear in: 10th International ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming.

[14] Ford, L. R., and Fulkerson, D. R. *Flows in Networks*. Princeton University Press, 1962.

[15] Franck, B., Neumann, K., and Schwindt, C. Truncated branch-andbound, schedule-construction, and schedule-improvement procedures for resourceconstrained project scheduling. *OR Spectrum 23*, 3 (2001), 297–324.