Skip to main content
SpringerLink
Log in

A constraint programming approach for the resource-constrained project scheduling problem

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

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.

    Article  Google Scholar 

  • Baptiste, P., & Le Pape, C. (2000). Constraint propagation and decomposition techniques for highly disjunctive and highly cumulative project scheduling problems. Constraints, 5, 119–139.

    Article  Google Scholar 

  • Brucker, P., & Knust, S. (2000). A Linear programming and constraint propagation for the RCPSP. European Journal of Operational Research, 127, 355–362.

    Article  Google Scholar 

  • 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.

    Article  Google Scholar 

  • 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.

    Article  Google Scholar 

  • 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.

    Article  Google Scholar 

  • 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.

    Article  Google Scholar 

  • 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.

    Google Scholar 

  • 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.

    Article  Google Scholar 

  • Dorndorf, U., Pesch, E., & Phan-Huy, T. (2000b). Constraint propagation techniques for disjunctive scheduling problems. Artif. Intell., 122, 189–240.

    Article  Google Scholar 

  • 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.

    Article  Google Scholar 

  • Kolisch, R., & Sprecher, A. (1996). PSPLIB—A project scheduling library. European Journal of Operational Research, 96, 205–216.

    Article  Google Scholar 

  • 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.

    Google Scholar 

  • 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.

    Article  Google Scholar 

  • Sankaran, J., Bricker, D., & Juang, S. (1999). A strong fractional cutting-plane algorithm for RCPSP. International Journal of Industrial Engineering, 6, 99–111.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Université d’Avignon et des Pays de Vaucluse, Laboratoire d’Informatique d’Avignon, 339 chemin des Meinajariès, Agroparc BP 1228, 84911, Avignon Cedex 9, France

    Olivier Liess

  2. MPCOMP, Universidade Estaduale do Ceará, Av. Paranjana, 1700, Campus do Itaperi, Fortaleza, Ceará, CEP 601740-000, Brazil

    Philippe Michelon

Authors
  1. Olivier Liess
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Philippe Michelon
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Olivier Liess.

Rights and permissions

Reprints 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

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-007-0188-y

Keywords

Search

Navigation