A robust hybrid method for the resource-constrained project scheduling problem with discounted cash flows

Láng, Blanka (2010) A robust hybrid method for the resource-constrained project scheduling problem with discounted cash flows. Pollack Periodica, 5 (3). pp. 167-174. ISSN 1788-1994

Text pollack.5.2010.3.14.pdf Restricted to Repository staff only until 31 December 2030. Download (168kB)

Abstract

In this paper computational results are presented in order to illustrate the efficiency and robustness of the hybrid meta-heuristic algorithm that was presented previously. These results refer to only a ‘hard’ subset of the J30 subset from the well-known PSPLIB. In this subset there are instances for a feasible solution that can be got within 900-second time limit, but optimal solution cannot be found within this time limit. The efficiency and the solution time of two algorithms were compared: the present hybrid algorithm and an other approach, a state-of-the-art MPL system with callable MILP solver (CPLEX 8.1). The obtained computational results confirmed the expectations the hybrid algorithm is a robust and fast approach for the resource-constrained project-scheduling problem with discounted cash flows.

Actions (login required)

Edit Item