Abstract
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.
Original language | English |
---|---|
Article number | 01003 |
Journal | E3S Web of Conferences |
Volume | 97 |
DOIs | |
Publication status | Published - 29 May 2019 |
Externally published | Yes |
Event | 22nd International Scientific Conference on Construction the Formation of Living Environment, FORM 2019 - Tashkent, Uzbekistan Duration: 18 Apr 2019 → 21 Apr 2019 |