Research Article
A Memetic Algorithm for Multiskill Resource-Constrained Project Scheduling Problem under Linear Deterioration
Algorithm 1
Main sketch of the proposed GVNS-MA.
| Input: Problem instance I, the size of population | |
| (), the depth of GVNS | |
| Output: the best configuration found during the | |
| search | |
| Population_initialization() /∗Sec- | |
| tion 4.3∗/ | |
| whiledo | |
| Isolate a solution pair ran- | |
| domly | |
| crossOver /∗Section 4.4∗/ | |
| GVNS_Operator /∗Section 4.5∗/ | |
| ifthen | |
| UpdatePopulation /∗Sec- | |
| tion 4.6∗/ | |
| end if | |
| end while | |
| Return arg min |