Variable Neighborhood Search for the Resource Constrained Project Scheduling Problem Full article
| Conference |
18th International conference on mathematical optimization theory and operations research 08-12 Jul 2019 , Екатеринбург |
||||
|---|---|---|---|---|---|
| Journal |
Communications in Computer and Information Science
ISSN: 1865-0929 |
||||
| Output data | Year: 2019, Volume: 1090, Pages: 39-50 Pages count : 12 DOI: 10.1007/978-3-030-33394-2_4 | ||||
| Tags | Project management, resource-constrained project scheduling problem, renewable resources, variable neighborhood search. | ||||
| Authors |
|
||||
| Affiliations |
|
Abstract:
We consider the resource-constrained project scheduling problem (RCPSP) with respect to the makespan minimization criterion. The problem accounts for technological constraints of activities precedence together with resource constraints. Activities preemptions are not allowed. The problem with renewable resources is NP-hard in the strong sense. We propose a variable neighborhood search algorithm with two neighborhoods. Numerical experiments based on standard RCPSP test dataset j120 from the PCPLIB library demonstrated that the proposed algorithm produces better results than existing algorithms in the literature for large-sized instances. For some instances from the dataset j120 the best known heuristic solutions were improved.
Cite:
Goncharov E.N.
Variable Neighborhood Search for the Resource Constrained Project Scheduling Problem
Communications in Computer and Information Science. 2019. V.1090. P.39-50. DOI: 10.1007/978-3-030-33394-2_4 Scopus OpenAlex
Variable Neighborhood Search for the Resource Constrained Project Scheduling Problem
Communications in Computer and Information Science. 2019. V.1090. P.39-50. DOI: 10.1007/978-3-030-33394-2_4 Scopus OpenAlex
Dates:
| Published online: | Oct 27, 2019 |
Identifiers:
| Scopus: | 2-s2.0-85076184267 |
| OpenAlex: | W2982596000 |