Skip to main navigation Skip to search Skip to main content

Memetic algorithm to minimize costs of activities in RCPSP

  • Universidad de la Sabana

Research output: Contribution to journal › Journal Article › peer-review

3 Citations (Scopus)

Abstract

The resource-constrained project scheduling problem (RCPSP) is a classic and important problem in project management and has gotten much attention from researchers. In this paper, we consider the case in which the cost of activities has to be minimized. This variant of the problem can be found mainly in construction management supply chains. Its characteristics show that this objective function is non-regular and that the problem is NP-hard. This paper presents a memetic algorithm to solve this problem. Computational experiments are carried out using well-known instances from the PSPLIB. Results obtained validate the effectiveness of the proposed algorithm and allow us to understand the algorithm's behavior.

Original languageEnglish
Pages (from-to)86-95
Number of pages10
JournalDYNA (Colombia)
Volume79
Issue number174
Publication statusPublished - 2012
Externally publishedYes

Keywords

  • Activity cost
  • Memetic algorithm
  • Project scheduling

ASJC Scopus subject areas

  • General Engineering

Fingerprint

Dive into the research topics of 'Memetic algorithm to minimize costs of activities in RCPSP'. These topics are generated from the title and abstract of the publication. Together, they form a unique fingerprint.

Cite this