2019
DOI: 10.1155/2019/9459375
|View full text |Cite
|
Sign up to set email alerts
|

A Memetic Algorithm for Multiskill Resource‐Constrained Project Scheduling Problem under Linear Deterioration

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 solu… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
5

Relationship

1
4

Authors

Journals

citations
Cited by 5 publications
(2 citation statements)
references
References 52 publications
0
2
0
Order By: Relevance
“…Dai et al [49] introduced a General VNS aimed at minimizing the maximum completion time under stepdeterioration, while Dai and Cheng [50] proposed a General VNS based Path Relinking algorithm to tackle the MS-RCPSP with multiple restrictions by incorporating a local refinement process and a path relinking framework. In a related work, the same authors (Dai and Cheng [51] presented a General VNS based Memetic Algorithm that integrated a solution recombination operator and a local optimization procedure. In the same context, several novel optimization techniques have been proposed by researchers to improve solution quality.…”
Section: Solution Approachesmentioning
confidence: 99%
“…Dai et al [49] introduced a General VNS aimed at minimizing the maximum completion time under stepdeterioration, while Dai and Cheng [50] proposed a General VNS based Path Relinking algorithm to tackle the MS-RCPSP with multiple restrictions by incorporating a local refinement process and a path relinking framework. In a related work, the same authors (Dai and Cheng [51] presented a General VNS based Memetic Algorithm that integrated a solution recombination operator and a local optimization procedure. In the same context, several novel optimization techniques have been proposed by researchers to improve solution quality.…”
Section: Solution Approachesmentioning
confidence: 99%
“…Moreover, abundant solution methodologies are designed to solve the intractable scheduling problems with diferent deterioration efects, such as variable neighborhood search (VNS) [28,29], B&B algorithm [30,31], memetic algorithm [32,33], tabu search algorithm [34,35], diferential evolution algorithm [36,37], learning algorithm [38][39][40], and so forth.…”
Section: Te Research Of Scheduling With Deteriorationmentioning
confidence: 99%