A dynamic resource constrained project scheduling problem

André Renato Villela Da Silva and Luiz Satoru Ochi

International Journal of Data Mining, Modelling and Management, 2013, vol. 5, issue 4, 370-379

Abstract: In this paper, we present a variant of classical scheduling problems which deal with restricted resources. Unlike other models studied in the literature, the proposed model has no upper bound for the amount of available resources. The objective of this variant is to find a solution that maximises this amount at the end of the planning horizon. A hybrid evolutionary algorithm is proposed for this problem presenting very promising computational results.

Keywords: project scheduling; evolutionary algorithms; mathematical formulation; metaheuristics; dynamic scheduling; resource constrained projects. (search for similar items in EconPapers)
Date: 2013
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=57685 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijdmmm:v:5:y:2013:i:4:p:370-379

Access Statistics for this article

More articles in International Journal of Data Mining, Modelling and Management from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().