Scheduling resource-constrained projects using branch and bound and parallel computing techniques Online publication date: Wed, 20-Jul-2005
by Fortunato Crespo Abril, Concepcion Maroto Alvarez
International Journal of Operational Research (IJOR), Vol. 1, No. 1/2, 2005
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.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Operational Research (IJOR):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook