| Issue |
E3S Web Conf.
Volume 97, 2019
XXII International Scientific Conference “Construction the Formation of Living Environment” (FORM-2019)
|
|
|---|---|---|
| Article Number | 01003 | |
| Number of page(s) | 12 | |
| Section | Smart City | |
| DOI | https://doi.org/10.1051/e3sconf/20199701003 | |
| Published online | 29 May 2019 | |
Resource allocation problem in project management
1
Institute of Control Sciences of Russian Academy of Sciences, Russia
2
Moscow State University of Civil Engineering, Yaroslavskoe shosse, 26, Moscow, 129337, Russia
3
La Rochelle Business School, France
* Corresponding author: boristitarenko@mail.ru
Resource allocation problems in project management are notoriously complex. Therefore the development of efficient algorithms for solving various specific cases is a real problem. This paper shows a specific case of the problem, where a program has a particular structure. The resource allocation problem in such a program is reduced to classical Johnson’s problem or job-shop scheduling problem. Effective solution methods, by way of reducing to maximum flow problems, are suggested for some types of resources. For other cases, heuristic rules are developed, with a description of the situations in which these rules allow good enough solutions to be obtained.
© The Authors, published by EDP Sciences, 2019
This is an open access article distributed under the terms of the Creative Commons Attribution License 4.0 (http://creativecommons.org/licenses/by/4.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.