Volume 48, Number 1, January-March 2014
|Page(s)||1 - 24|
|Published online||05 December 2013|
Simulated Annealing and Tabu Search for Discrete-Continuous Project Scheduling with Discounted Cash Flows
Institute of Computing Science, Poznan University of
Accepted: 17 September 2013
Discrete-continuous project scheduling problems with positive discounted cash flows and the maximization of the NPV are considered. We deal with a class of these problems with an arbitrary number of discrete resources and one continuous, renewable resource. Activities are nonpreemptable, and the processing rate of an activity is a continuous, increasing function of the amount of the continuous resource allotted to the activity at a time. Three common payment models – Lump Sum Payment, Payments at Activity Completion times, and payments in Equal Time Intervals are analyzed. Formulations of mathematical programming problems for an optimal continuous resource allocation for each payment model are presented. Applications of two local search metaheuristics – Tabu Search and Simulated Annealing are proposed. The algorithms are compared on a basis of computational experiments. Some conclusions and directions for future research are pointed out.
Mathematics Subject Classification: 68M20 / 90B35 / 90C30 / 90C59
Key words: Discrete-continuous project scheduling / discounted cash flows / net present value / payment models / nonlinear programming / metaheuristics / simulated annealing / tabu search
© EDP Sciences, ROADEF, SMAI, 2013
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.