48172

Автор(ы): 

Архипов Д. И. (ИПУ РАН, Лаборатория 68) НЕАКТУАЛЬНАЯ ЗАПИСЬ
Battaia O. ?. (ISAE Supaero)
Лазарев А. А. (ИПУ РАН, Лаборатория 68)

Автор(ов): 

3

Параметры публикации

Тип публикации: 

Доклад

Название: 

A new polynomial-time algorithm for calculating upper bounds on resource usage for RCPSP problem

ISBN/ISSN: 

9788894982022

Наименование конференции: 

  • 16th International Conference on Project Management and Scheduling (Rome, 2018)

Наименование источника: 

  • Proceedings of the 16th International Conference on Project Management and Scheduling (Rome, 2018)

Город: 

  • Rome

Издательство: 

  • TexMat

Год издания: 

2018

Страницы: 

22-25 http://www.pms2018.ing.uniroma2.it/PMS2018_Proceedings.pdf
Аннотация
The Resource-Constrained Project Scheduling Problem (RCPSP) is considered. This problem is NP-hard in strong sense (Garey and Johnson 1975). In this paper, a new polynomial-time approach is developed to find an upper bound on resource consumption. This bound can be also used to calaculate a lower bound for makespan. The procedure also helps to increase the efficiency of existed propagators and to improve constraint programming model performances by tightening decision variables domains.

Библиографическая ссылка: 

Архипов Д.И., Battaia O.?., Лазарев А.А. A new polynomial-time algorithm for calculating upper bounds on resource usage for RCPSP problem / Proceedings of the 16th International Conference on Project Management and Scheduling (Rome, 2018). Rome: TexMat, 2018. С. 22-25 http://www.pms2018.ing.uniroma2.it/PMS2018_Proceedings.pdf.