A flexible heuristic for a multi-mode capital constrained project scheduling problem with probabilistic cash inflows

https://doi.org/10.1016/S0305-0548(96)00058-5Get rights and content

Abstract

We consider housing projects where an initial capital covers activity expenditures in the starting phase of the project and then, customers who arrive randomly over the project span provide the necessary funds for continuation. The goal is to maximize financial returns, i.e., the project Net Present Value (NPV). Here, capital is considered as a limited nonrenewable resource which is reduced by activity expenditures and augmented by the sales of flats. Activities may be carried out in different operating modes with different durations. The total cost of an activity is fixed irrespective of its operating mode. Thus, the rate of activity expenditures differ from mode to mode. As the previous scheduling decisions are the only controllable factors affecting the available capital at any period, it is important to adjust the speed of expenditures, namely, to select the correct activity modes. The contractor, never sure of the timing of the cash inflows, has to schedule the activities in modes which do not lead to financial bottlenecks and at the same time he has to deliver the project on time. The contractor may also borrow capital from an external source. We propose a flexible heuristic algorithm for solving the capital constrained mode selection problem where there exist general precedence relationships among activities and the magnitude of precedence lags depend on the specific activity mode selected. The algorithm is flexible in the sense that different mode selection criteria are utilized at different decision times depending on the cumulative progress of the project and on some parameters controlled by the contractor. The proposed algorithm may be used as a simulation tool to adjust parameters before the project starts or it may be used as a scheduler during the progress of the project given the current financial situation and cumulative project work done. We test the algorithm by using a typical housing project with real data and also by using hypothetical test problems. The results indicate that the schedules generated are satisfactory with regard to meeting the target project due date and maximizing NPV.

References (39)

  • S.E. Elmaghraby et al.

    The scheduling of activities to maximize the net present value of projects

    Eur. J. Opl Res.

    (1990)
  • R.A. Russel

    A comparison of heuristics for scheduling projects with cash flow and resource restrictions

    Mgmt Sci.

    (1986)
  • A.H. Russel

    Cash flows in networks

    Mgmt Sci.

    (1970)
  • A.A.B. Pritsker et al.

    Multi-project scheduling with limited resources: a zero-one programming approach

    Mgmt Sci.

    (1969)
  • E.W. Davis et al.

    A comparison of heuristics and optimum solutions in resource constrained project scheduling

    Mgmt Sci.

    (1975)
  • A. Alvarez-Valdes et al.

    Heuristic Algorithms for Resource Constrained Project Scheduling: A Review and an Empirical Analysis

  • E. Demeulemeester et al.

    A branch and bound procedure for the multiple resource constrained project scheduling problem

    Mgmt Sci.

    (1992)
  • G. Ulusoy et al.

    A constraint based perspective in resource constrained project scheduling

    Int. J. Prod. Res.

    (1994)
  • F.B. Talbot

    Resource constrained project scheduling with time-resource tradeoffs: the nonpreemptive case

    Mgmt Sci.

    (1982)
  • Cited by (0)

    Linet Özdamar has received her BS, MS and Ph.D. degree from Boǧaziçi University, Department of Industrial Engineering, Istanbul, Turkey. She is an Associate Professor in the Department of Systems Engineering, at Yeditepe University, Istanbul, and currently holds the position of deputy Department Head. Her research interests lie in the fields of project machine scheduling, production planning and control. She has published related articles in the J. Opl Res. Soc., Int. J. Prod. Res., Eur. J. Opl Res., Int. J. Prod. Opns Mgmt, J. Opns Mgmt, IIE Trans. Prod. Planning and Control, Comp. Industrial Engg.

    §

    Hakan Dündar has an Industrial Engineering degree from Boǧaziçi University and is a graduate student at the Industrial Engineering Graduate Program at Marmara University. He is also currently running a construction company.

    View full text