Scheduling resource-constrained projects using branch and bound and parallel computing techniques

Fortunato Crespo Abril and Concepcion Maroto Alvarez

International Journal of Operational Research, 2005, vol. 1, issue 1/2, 172-187

Abstract: Based on the idea of dividing the task into several processes, we centre our interest on the techniques provided by parallel computing to solve the resource-constrained project scheduling problem, with the objective of obtaining a feasible schedule for the activities that minimises the length of the total project. The scheme that leads to the best results performs a static first-level decomposition of the solution tree, where processes search for a compromise between the benefits obtained after a parallel search and the communication and coordination costs implied. The contribution of the concept of safe cutsets has allowed the cutset dominance rule to be applied in a parallel implementation. Similar considerations will have to be taken into account when solving other problems, by designing parallel branch and bound algorithms which use dominance rules that are only applicable when performing a depth-first search.

Keywords: project management; project scheduling; optimisation; parallel computing; branch and bound; resource constraints. (search for similar items in EconPapers)
Date: 2005
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=7440 (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:ijores:v:1:y:2005:i:1/2:p:172-187

Access Statistics for this article

More articles in International Journal of Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().