A VNS-GA-based hybrid metaheuristics for resource constrained project scheduling problem

Kanchan Joshi, Karuna Jain and Vijay Bilolikar

International Journal of Operational Research, 2016, vol. 27, issue 3, 437-449

Abstract: This paper presents hybrid metaheuristics for resource constrained project scheduling problem to minimise makespan. The hybrid metaheuristics is combination of variable neighbourhood search (VNS) and genetic algorithm (GA). Variable neighbourhood search, a local search metaheuristics strengthens the exploration process of GA. The chromosome of the population pool, generated using priority rule-based heuristics and GA operators, are processed using VNS. The schedules from GA and VNS together form the next generation population pool. Thus the hybrid mechanism provides a combination of exploration and exploitation process to achieve the desired objective. The solution scheme is tested using Kolisch library J30 and J60 datasets for multiple resource types and results are compared with the best available solutions. The computational experimentation presents the performance of the proposed hybrid metaheuristics.

Keywords: variable neighbourhood search; VNS; genetic algorithms; resource constraints; project scheduling; hybrid metaheuristics; project management. (search for similar items in EconPapers)
Date: 2016
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.inderscience.com/link.php?id=78938 (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:27:y:2016:i:3:p:437-449

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 ().