@conference {56273, title = {Maximising the Net Present Value of Project Schedules Using CMSA and Parallel ACO}, booktitle = {International Workshop on Hybrid Metaheuristics (HM 2019)}, volume = {LNCS 11299}, year = {2019}, pages = {16-30}, publisher = {Springer}, organization = {Springer}, abstract = {This study considers the problem of resource constrained project scheduling to maximise the net present value. A number of tasks must be scheduled within a fixed time horizon. Tasks may have precedences between them and they use a number of common resources when executing. For each resource, there is a limit, and the cumulative resource requirements of all tasks executing at the same time must not exceed the limits. To solve this problem, we develop a hybrid of Construct, Merge, Solve and Adapt (CMSA) and Ant Colony Optimisation (ACO). The methods are implemented in a parallel setting within a multi-core shared memory architecture. The results show that the proposed algorithm outperforms the previous state-of-the-art method, a hybrid of Lagrangian relaxation and ACO. }, doi = {https://doi.org/10.1007/978-3-030-05983-5_2}, author = {Thiruvady, Dhananjay and Blum, Christian and Ernst, Andreas T.} }