Lower Bound Polynomial Fast Procedure for the Resource-Constrained Project Scheduling Problem Tested on PSPLIB Instances Научная публикация
| Конференция |
The 9th International Conference on Analysis of Images, Social Networks and Texts 15-16 окт. 2020 , Moscow |
||||
|---|---|---|---|---|---|
| Журнал |
Lecture Notes in Computer Science
ISSN: 0302-9743 , E-ISSN: 1611-3349 |
||||
| Вых. Данные | Год: 2021, Том: 12602, Страницы: 407-420 Страниц : 14 DOI: 10.1007/978-3-030-72610-2_31 | ||||
| Ключевые слова | project management, Resource-Constrained Project Scheduling Problem, renewable resources, cumulative resources, PSPLIB, lower bound | ||||
| Авторы |
|
||||
| Организации |
|
Реферат:
We consider the intractable Resource-Constrained Project Scheduling Problem (RCPSP). It is assumed that
the intensity functions of resource allocation and consumption are constant on specified time intervals and there
are no deadlines. The procedure for calculating the lower bound for the RCPSP is constructed on the basis of
the relaxation of the problem by replacing renewable resources with cumulative ones. The time complexity of
this procedure depends on the number of activities n as a function of O(nlogn). From the analysis of numerical
experiments (which are carried out on examples of problems from the electronic library PSPLIB), it follows
that the proposed procedure is highly competitive, and in some series of instances gives results close to the best
lower bounds published in the PSPLIB with dramatically small CPU time (milliseconds).
Библиографическая ссылка:
Gimadi E.K.
, Goncharov E.N.
, Shtepa A.A.
Lower Bound Polynomial Fast Procedure for the Resource-Constrained Project Scheduling Problem Tested on PSPLIB Instances
Lecture Notes in Computer Science. 2021. V.12602. P.407-420. DOI: 10.1007/978-3-030-72610-2_31 Scopus OpenAlex
Lower Bound Polynomial Fast Procedure for the Resource-Constrained Project Scheduling Problem Tested on PSPLIB Instances
Lecture Notes in Computer Science. 2021. V.12602. P.407-420. DOI: 10.1007/978-3-030-72610-2_31 Scopus OpenAlex
Даты:
| Опубликована online: | 9 апр. 2921 г. |
Идентификаторы БД:
| Scopus: | 2-s2.0-85104756010 |
| OpenAlex: | W3153380395 |
Цитирование в БД:
Пока нет цитирований