Abstract
This paper proposes a general variable neighborhood search-based memetic algorithm (GVNS-MA) for solving the multiskill resource-constrained project scheduling problem under linear deterioration. Integrating a solution recombination operator and a local optimization procedure, the proposed GVNS-MA is assessed on two sets of instances and achieves highly competitive results. One set of benchmark instances is commonly used in the literature where the capability of the proposed algorithm to find high quality solutions is demonstrated, compared with the state-of-the-art algorithms in the literature. The other set revises the former through incorporating the linear deterioration effect. Two key components of the proposed algorithm are investigated to confirm their critical role to the success of the proposed method.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
