In this work an efficient heuristic solution technique for the Resource-Constrained Project Scheduling Problem (RCPSP) is proposed. This technique is a hybrid multi-pass method that combines random sampling procedures with a Backward-Forward scheduling method applied in a selective way. The performance of the new technique is evaluated against the best currently available heuristics using a well-known set of instances. The results obtained point out the interest of the selective use of the Backward-Forward scheduling methods as improving procedure. The resultant technique outperforms both the heuristics and metaheuristics currently available for the RCPSP, thus it is competitive with the best heuristic solution techniques for this problem.
An efficient multi-pass heuristic for project scheduling with constrained resources
Reprints and Corporate Permissions
Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?
To request a reprint or corporate permissions for this article, please click on the relevant link below:
Academic Permissions
Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?
Obtain permissions instantly via Rightslink by clicking on the button below:
If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.
Related Research Data
Related research
People also read lists articles that other readers of this article have read.
Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.
Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.