Standard

Variable Neighborhood Search for the Resource Constrained Project Scheduling Problem. / Goncharov, Evgenii N.

Mathematical Optimization Theory and Operations Research - 18th International Conference, MOTOR 2019, Revised Selected Papers. ред. / Igor Bykadorov; Vitaly Strusevich; Tatiana Tchemisova. Springer Gabler, 2019. стр. 39-50 (Communications in Computer and Information Science; Том 1090 CCIS).

Результаты исследований: Публикации в книгах, отчётах, сборниках, трудах конференций › статья в сборнике материалов конференции › научная › Рецензирование

Harvard

Goncharov, EN 2019, Variable Neighborhood Search for the Resource Constrained Project Scheduling Problem. в I Bykadorov, V Strusevich & T Tchemisova (ред.), Mathematical Optimization Theory and Operations Research - 18th International Conference, MOTOR 2019, Revised Selected Papers. Communications in Computer and Information Science, Том. 1090 CCIS, Springer Gabler, стр. 39-50, 18th International Conference on Mathematical Optimization Theory and Operations Research, MOTOR 2019, Ekaterinburg, Российская Федерация, 08.07.2019. https://doi.org/10.1007/978-3-030-33394-2_4

APA

Goncharov, E. N. (2019). Variable Neighborhood Search for the Resource Constrained Project Scheduling Problem. в I. Bykadorov, V. Strusevich, & T. Tchemisova (Ред.), Mathematical Optimization Theory and Operations Research - 18th International Conference, MOTOR 2019, Revised Selected Papers (стр. 39-50). (Communications in Computer and Information Science; Том 1090 CCIS). Springer Gabler. https://doi.org/10.1007/978-3-030-33394-2_4

Vancouver

Goncharov EN. Variable Neighborhood Search for the Resource Constrained Project Scheduling Problem. в Bykadorov I, Strusevich V, Tchemisova T, Редакторы, Mathematical Optimization Theory and Operations Research - 18th International Conference, MOTOR 2019, Revised Selected Papers. Springer Gabler. 2019. стр. 39-50. (Communications in Computer and Information Science). doi: 10.1007/978-3-030-33394-2_4

Author

Goncharov, Evgenii N. / Variable Neighborhood Search for the Resource Constrained Project Scheduling Problem. Mathematical Optimization Theory and Operations Research - 18th International Conference, MOTOR 2019, Revised Selected Papers. Редактор / Igor Bykadorov ; Vitaly Strusevich ; Tatiana Tchemisova. Springer Gabler, 2019. стр. 39-50 (Communications in Computer and Information Science).

BibTeX

@inproceedings{b0794f9d053c4d5db02ba6251c57defa,
title = "Variable Neighborhood Search for the Resource Constrained Project Scheduling Problem",
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.",
keywords = "Project management, Renewable resources, Resource-constrained project scheduling problem, Variable neighborhood search",
author = "Goncharov, {Evgenii N.}",
year = "2019",
month = jan,
day = "1",
doi = "10.1007/978-3-030-33394-2_4",
language = "English",
isbn = "9783030333935",
series = "Communications in Computer and Information Science",
publisher = "Springer Gabler",
pages = "39--50",
editor = "Igor Bykadorov and Vitaly Strusevich and Tatiana Tchemisova",
booktitle = "Mathematical Optimization Theory and Operations Research - 18th International Conference, MOTOR 2019, Revised Selected Papers",
address = "Germany",
note = "18th International Conference on Mathematical Optimization Theory and Operations Research, MOTOR 2019 ; Conference date: 08-07-2019 Through 12-07-2019",

}

RIS

TY - GEN

T1 - Variable Neighborhood Search for the Resource Constrained Project Scheduling Problem

AU - Goncharov, Evgenii N.

PY - 2019/1/1

Y1 - 2019/1/1

N2 - 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.

AB - 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.

KW - Project management

KW - Renewable resources

KW - Resource-constrained project scheduling problem

KW - Variable neighborhood search

UR - http://www.scopus.com/inward/record.url?scp=85076184267&partnerID=8YFLogxK

U2 - 10.1007/978-3-030-33394-2_4

DO - 10.1007/978-3-030-33394-2_4

M3 - Conference contribution

AN - SCOPUS:85076184267

SN - 9783030333935

T3 - Communications in Computer and Information Science

SP - 39

EP - 50

BT - Mathematical Optimization Theory and Operations Research - 18th International Conference, MOTOR 2019, Revised Selected Papers

A2 - Bykadorov, Igor

A2 - Strusevich, Vitaly

A2 - Tchemisova, Tatiana

PB - Springer Gabler

T2 - 18th International Conference on Mathematical Optimization Theory and Operations Research, MOTOR 2019

Y2 - 8 July 2019 through 12 July 2019

ER -

ID: 22996018