A Two-Phase Algorithm for a Resource Constrained Project Scheduling Problem with Discounted Cash Flows

Journal Title: Decision Making in Manufacturing and Services - Year 2013, Vol 7, Issue 1

Abstract

This paper presents a Resource-Constrained Project Scheduling Problem (RCPSP) settled by contractual milestones. The criterion analysed here is the maximisation of aggregate discounted cash flows from the contractor’s perspective, known as an RCPSP problem with Discounted Cash Flows (RCPSPDCF). The cash flows analysed here cover the contractor’s cash outflows (negative cash flows), related to the commencement of individual activities, and cash inflows (positive cash flows) after the fulfilment of individual milestones. The authors propose a two-phase algorithm for solving the problem defined. In the first phase, the simulated annealing metaheuristics is used, designed to identify a forward schedule with as high total DCF as possible. In the second phase, the best first-phase schedule is improved by right shifts of activities. To this end, the procedure which iteratively shifts tasks by one unit is applied, with a view to maximising the objective function. Activity shifts take into consideration precedence and resource constraints, and they are performed for a specified resource allocation to activities. This paper also includes an analysis of the problem for a sample project. The results of computational experiments are then analysed. The experiments were run with the use of standard test problems from the Project Scheduling Problem LIBrary (PSPLIB), with additionally defined cash flows and contractual milestones.

Authors and Affiliations

Piotr Łebkowski, Marcin Klimek

Keywords

Related Articles

Allocating Pooled Inventory According to Contributions and Entitlements

Inventory pooling, whether by centralization of stock or by mutual assistance, is known to be beneficial when demands are uncertain. But when the retailers are independent, the question is how to divide the benefits of p...

A Distributed Decision-Support System for Virtual Prototyping

Virtual Prototyping (VP) is a data-driven design process that promotes both knowledge reuse and innovation. High-profile applications in the automotive and aerospace industries have demonstrated its potential to signific...

A Transfer Line Balancing Problem by Heuristic Methods: Industrial Case Studies

The paper deals with the problem of optimal configuration of a type of transfer lines which are equipped with transfer machines. Such machines perform operations with standard modular spindle heads which are activated se...

A Loss Function for Box-Constrained Inverses Problems

A loss function is proposed for solving box-constrained inverse problems. Given causality mechanisms between inputs and outputs as smooth functions, an inverse problem demands to adjust the input levels to make the outpu...

Insertion Algorithms with Justification for Solving the Resource-Constrained Project Scheduling

The paper presents the resource-constrained project scheduling problem with the makespan minimisation criterion. To solve the problem, the authors propose insertion algorithms which generate schedules with use of forward...

Download PDF file
  • EP ID EP165874
  • DOI 10.7494/dmms.2013.7.1.51
  • Views 117
  • Downloads 0

How To Cite

Piotr Łebkowski, Marcin Klimek (2013). A Two-Phase Algorithm for a Resource Constrained Project Scheduling Problem with Discounted Cash Flows. Decision Making in Manufacturing and Services, 7(1), 51-68. https://europub.co.uk/articles/-A-165874