|
ИСТИНА |
Войти в систему Регистрация |
ФНКЦ РР |
||
Estimating Maximum Resource Load for Resource-Constrained Project Scheduling Problemстатья
- Авторы: Alexander Lazarev, German Tarasov, Dmitry Arkhipov
- Сборник: Proceedings of the 8th International Conference on Optimization and Applications (OPTIMA-2017)
- Серия: CEUR Workshop Proceedings (CEUR-WS.org)
- Том: 1987
- Год издания: 2017
- Место издания: CEUR-WS
- Первая страница: 356
- Последняя страница: 363
- Аннотация: This paper focuses on estimating maximum resource loads in Resource- Constrained Project Scheduling Problem (RCPSP). We examine a vari- ant of vector sum problem with fractions: considering preemptions al- lowed, determine what part of each of n jobs should be accomplished in order to minimize sum of squares of non-consumed amounts of re- sources, taking into account the resource constraints along with mini- mizing the number of preemptions. We prove that in case of 2 resources, the optimal solution contains only 2 or less preemptions, and present two polynomial algorithms of finding such solution with time complexi- ties of O(n 2 ) operations. We also present an investigation of the general case of arbitrary number of resources.
- Добавил в систему: Лазарев Александр Алексеевич
Прикрепленные файлы
| № | Имя | Описание | Имя файла | Размер | Добавлен |
|---|---|---|---|---|---|
| 1. | Полный текст | paper52.pdf | 97,4 КБ | 23 декабря 2017 [Lazarev] | |
| 2. | CEUR-WS.pdf | CEUR-WS.pdf | 156,4 КБ | 23 декабря 2017 [Lazarev] |