TítuloMaximising the Net Present Value of Project Schedules Using CMSA and Parallel ACO
Publication TypeConference Paper
Year of Publication2019
AuthorsThiruvady D, Blum C, Ernst AT
Conference NameInternational Workshop on Hybrid Metaheuristics (HM 2019)
VolumeLNCS 11299
EditorialSpringer
Paginación16-30
Resumen

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.

DOI10.1007/978-3-030-05983-5_2