A branch and bound algorithm for project scheduling problem with discounted cash flows

2016-12-01
COMERT, ALİCAN
Azizoğlu, Meral
In this study, we consider a project payment model with discounted cash flows. We assume that the client payment times are defined in the project contract. The activities are characterised by their processing times and costs that are incurred at their completion times. Our problem is to find the activity completion times so as to maximise the net present value of the client payments and activity costs. We show that the problem is strongly NP-hard. We formulate the problem as a mixed integer nonlinear programming model and propose a branch and bound algorithm that employs efficient lower and upper bounding mechanism
International Journal of Planning and Scheduling

Suggestions

A Project payment scheduling problem with discounted cash flows
Cömert, Alican; Azizoğlu, Meral; Department of Industrial Engineering (2014)
In this study we consider a project payment model with discounted cash flows. We assume that the client payment times are defined in the project contract. The activities are characterized by their processing times and costs that are incurred at their completions. Our problem is to find the client payment amounts and activity completion times so as to minimize the net present value of the client payments and activity costs. We show that the problem is strongly NP-hard. We formulate the problem as a mixed int...
An optimal procedure for the coordinated replenishment dynamic lot-sizing problem with quantity discounts
Chung, CS; Hum, SH; Kirca, O (2000-12-01)
We consider in this paper the coordinated replenishment dynamic lot-sizing problem when quantity discounts are offered. In addition to the coordination required due to the presence of major and minor setup costs, a separate element of coordination made possible by the offer of quantity discounts needs to be considered as well. The mathematical programming formulation for the incremental discount version of the extended problem and a tighter reformulation of the problem based on variable redefinition are pro...
The Impact of Modeling on Robust Inventory Management Under Demand Uncertainty
Solyali, Oguz; Cordeau, Jean-Francois; Laporte, Gilbert (2016-04-01)
This study considers a basic inventory management problem with nonzero fixed order costs under interval demand uncertainty. The existing robust formulations obtained by applying well-known robust optimization methodologies become computationally intractable for large problem instances due to the presence of binary variables. This study resolves this intractability issue by proposing a new robust formulation that is shown to be solvable in polynomial time when the initial inventory is zero or negative. Becau...
A mixed integer model for optimization of discrete time cost tradeoff problem
Tatar, Ali Can; Bilir, Mert; Sönmez, Rifat; Atan, Sabri Tankut (null; 2016-06-25)
In construction projects, activity durations can be expedited by allocating additional resources. Decreasing activity durations by means of crashing, usually leads to increase in the direct expenses. This trade-off between time and cost is called as the time-cost trade-off problem. Since in practice many resources are available in discrete units, numerous research has focussed on the discrete version of this problem called the discrete time-cost trade-off problem (DTCTP). Achieving the project schedule that...
A cost-effective simulation algorithm for inspection interval optimization: An application to mining equipment
Gölbaşı, Onur; Demirel, Nuray (2017-11-01)
In machinery maintenance policies, regular inspection intervals should be specified in such a way that the cumulative of direct and indirect financial consequences of maintenance activities should be minimized while supporting the functional health of system components. This study aims to develop a simulation algorithm, called the time-counter, to optimize inspection intervals. In the algorithm, uptime and downtime behaviors of the system components and production losses in the corrective repairs are consid...
Citation Formats
A. COMERT and M. Azizoğlu, “A branch and bound algorithm for project scheduling problem with discounted cash flows,” International Journal of Planning and Scheduling, pp. 233–251, 2016, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/37499.