Skip to main content
SpringerLink
Log in

Minimizing the completion time of a project under resource constraints and feeding precedence relations: an exact algorithm

  • Research Paper
  • Published:
4OR Aims and scope Submit manuscript

Abstract

In this paper we study an extension of the Resource-Constrained Project Scheduling Problem (RCPSP) with minimum makespan objective by introducing a special type of precedence constraints called “Feeding Precedences” (FP). To the best of our knowledge no exact algorithm exists for this problem. Exploiting the lower bound and the mathematical formulation proposed in Bianco and Caramia (4OR 9(4):371–389 2011) for the RCPSP with FP, in this paper we propose an exact algorithm based on branch and bound rules. A computational experimentation on randomly generated instances and a comparison with the results achieved by a commercial solver, show that the proposed approach is able to behave satisfactorily.

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.

Similar content being viewed by others

References

  • Alfieri A, Tolio T, Urgo M (2011) A project scheduling approach to production planning with feeding precedence relations. Int J Prod Res 49(4): 995–1020

    Article  Google Scholar 

  • Bartusch M, Mohring RH, Radermacher FJ (1988) Scheduling project networks with resource constraints and time windows. Ann Oper Res 16: 201–240

    Article  Google Scholar 

  • Bianco L, Caramia M (2011) Minimizing the completion time of a project under resource constraints and feeding precedence relations: a Lagrangian relaxation based lower bound. 4OR 9(4): 371–389

    Article  Google Scholar 

  • Elmaghraby SEE, Kamburowski J (1992) The analysis of activity networks under generalized precedence relations (GPRs). Manag Sci 38(9): 1245–1263

    Article  Google Scholar 

  • Kelley JE (1963) The critical path method: resource planning and scheduling. In: Muth JF, Thompson GL (eds) Industrial scheduling. Prentice Hall, NJ, pp 347–365

    Google Scholar 

  • Kis T, Erdõs G, Márkus A, Váncza J (2004) A project-oriented decision support system for production planning in make-to-order manufacturing. ERCIM News 58: 66–67

    Google Scholar 

  • Kis T (2005) A branch-and-cut algorithm for scheduling of projects with variable-intensity activities. Math Program 103(3): 515–539

    Article  Google Scholar 

  • Kis T (2006) Rcps with variable intensity activities and feeding precedence constraints. In: Perspectives in modern project scheduling, Springer, Berlin, pp 105–129

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Ingegneria dell’Impresa, Università di Roma “Tor Vergata”, Via del Politecnico, 1, 00133, Roma, Italy

    Lucio Bianco & Massimiliano Caramia

Authors
  1. Lucio Bianco
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Massimiliano Caramia
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Massimiliano Caramia.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bianco, L., Caramia, M. Minimizing the completion time of a project under resource constraints and feeding precedence relations: an exact algorithm. 4OR-Q J Oper Res 10, 361–377 (2012). https://doi.org/10.1007/s10288-012-0205-0

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10288-012-0205-0

Keywords

MSC classification

Search

Navigation