An efficient algorithm for the multi-mode resource constrained project scheduling problem with resource flexibility Online publication date: Thu, 30-Sep-2010
by Najib M. Najid, Marouane Arroub
International Journal of Mathematics in Operational Research (IJMOR), Vol. 2, No. 6, 2010
Abstract: The scheduling problem under study may be viewed as an extension of the standard multi-mode resource-constrained project scheduling problem (MRCPSP) including multi-skilled labour and will be called as MRCPSP-MS. This problem requires an integration of resource limitation, labour skills and multiple possible execution modes for each task, and the objective is to minimise the overall project duration. This paper present a new tabu search (TS) algorithm using a powerful neighbourhood function based on a flow graph representation in order to implement various search strategies. The search of the solution space is carried out via two types of moves. Furthermore, the TS algorithm is embedded in a decomposition-based heuristic (DBH) which serve to reduce the solution space. The effectiveness of the new TS is demonstrated through extensive experimentation on different standard benchmark problem instances and proves that our results are competitive.
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 Mathematics in Operational Research (IJMOR):
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