Abstract
A “pure” Constraint Programming approach for the Resource-Constrained Project Scheduling Problem (RCPSP) is presented. Our basic idea was to substitute the resource constraints by a set of “sub-constraints” generated as needed. Each of these sub-constraints corresponds to a set of tasks that cannot be executed together without violating one of the resource constraints. A filtering algorithm for these sub-constraints has been developed. When applied to the initial resource constraints together with known filtering algorithms, this new filtering algorithm provides very good numerical results.
Similar content being viewed by others
References
Baptiste, P., & Demassey, S. (2004). Tight LP bounds for resources constrained project scheduling. OR Spectrum, 26, 251–262.
Baptiste, P., & Le Pape, C. (2000). Constraint propagation and decomposition techniques for highly disjunctive and highly cumulative project scheduling problems. Constraints, 5, 119–139.
Brucker, P., & Knust, S. (2000). A Linear programming and constraint propagation for the RCPSP. European Journal of Operational Research, 127, 355–362.
Brucker, P., Knust, S., Schoo, A., & Thiele, O. (1998). A branch and bound algorithm for the resource-constrained project scheduling problem. European Journal of Operational Research, 127, 272–288.
Brucker, P., Drexl, A., Moring, R., Neumann, K., & Pesch, E. (1999). Resource-constrained project scheduling: notation, classification, models and methods. European Journal of Operational Research, 112, 3–41.
Carlier, J., & Pinson, E. (1991). A practical use of Jacson’s preemptive schedule for solving the job-shop problem. European Journal of Operational Research, 78, 146–161.
Demassey, S., Artigues, C., & Michelon, P. (2005) Constraint propagation based cutting planes: an application to the resource-constrained project scheduling problem. INFORMS Journal on Computing (to appear).
Demeulemeester, E. L., & Herroelen, W. S. (1997). New benchmark results for the resource-constrained project scheduling problem. Management Sciences, 43, 1485–1492.
Dorndorf, U., Pesch, E., & Phan-Huy, T. (1999). A survey of interval capacity consistency tests for time and resource constrained scheduling. In Project scheduling—recent models, algorithms and applications (pp. 213–238). Dordrecht: Kluwer Academic.
Dorndorf, U., Pesch, E., & Phan-Huy, T. (2000a). A branch and bound algorithm for the resource-constrained project scheduling problem. Mathematical Methods of Operations Research, 52, 413–439.
Dorndorf, U., Pesch, E., & Phan-Huy, T. (2000b). Constraint propagation techniques for disjunctive scheduling problems. Artif. Intell., 122, 189–240.
Gondran, M., & Minoux, M. (1990) Graphes et algorithmes. Eyrolles.
Klein, R., & Scholl, A. (1999). Computing lower bounds by destructive improvement—an application to RCPSP. European Journal of Operational Research, 112, 322–346.
Kolisch, R., & Sprecher, A. (1996). PSPLIB—A project scheduling library. European Journal of Operational Research, 96, 205–216.
Mingozzi, A., Maniezzo, S., Ricciardelli, S., & Blanco, L. (1998). An exact algorithm for project scheduling with resource constraint based on a new mathematical formulation. Management Sciences, 44, 714–729.
Palpant, M., Artigues, C., & Michelon, P. (2004). LSSPER: a large neighborhood search for the resource-constrained project scheduling problem. Annals of Operations Research, 31, 237–257. Special Issue on Metaheuristics.
Sankaran, J., Bricker, D., & Juang, S. (1999). A strong fractional cutting-plane algorithm for RCPSP. International Journal of Industrial Engineering, 6, 99–111.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Liess, O., Michelon, P. A constraint programming approach for the resource-constrained project scheduling problem. Ann Oper Res 157, 25–36 (2008). https://doi.org/10.1007/s10479-007-0188-y
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-007-0188-y