Premium
A Modified Variable Neighbourhood Search Heuristic for the Multi‐Mode Resource Constrained Project Scheduling Problem with A Case Study
Author(s) -
Chakrabortt Ripon K,
Abbasi Alireza,
Ryan Michael J
Publication year - 2019
Publication title -
incose international symposium
Language(s) - English
Resource type - Journals
ISSN - 2334-5837
DOI - 10.1002/j.2334-5837.2019.00657.x
Subject(s) - computer science , mathematical optimization , harmony search , scheduling (production processes) , heuristic , implementation , operations research , artificial intelligence , engineering , mathematics , software engineering
This paper provides a fast near‐optimum solution to the Multi‐Mode Resource Constrained Project Scheduling Problem (MRCPSP), for projects with activities that have known deterministic renewable and non‐renewable resource requirements. Multi‐modes allows any activity to execute one of many alternative combinations of resource usages and durations, while each activity needs to pick the most feasible one. This type of setting is more prevalent for real‐life project schedules, which necessitates systematic methodologies and advanced solution approaches in harmony with real‐world implementations. This study proposes a Modified Variable Neighbourhood Search Heuristic (MVNSH) algorithm as an advanced optimization technique for scheduling projects. To validate our approach, exhaustive computational tests were carried out by using relevant benchmark instances. The MVNSH algorithm has been shown to be faster and more accurate than many existing heuristic methods. This research also contributes to developing a practical decision support system for resolving real‐life constraints in multi‐mode resource‐constrained projects.