Determination of Search Domain of Resource Constrained Project Scheduling Problem
Küçük Resim Yok
Tarih
2024
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Asociacion Espanola de Direccion e Ingenieria de Proyectos (AEIPRO)
Erişim Hakkı
info:eu-repo/semantics/closedAccess
Özet
Resource constrained project scheduling is an important problem of construction management. Procurement of excessive number of resources significantly increases the total project cost. Therefore, restrictions on the number of resources are defined and the optimum solution of resource constrained project scheduling problem provides the shortest project completion time. The aforementioned problem is NP-Hard since the search domain of the problem increases exponentially if the number of activities increases. In this study, the size of the search domain of the problem is examined by considering the number of activities. Contributions of the activities on the serial and parallel paths are examined. Equations representing the size of the search domain against the number of activities are derived for the aforementioned situations. The provided relationships represent the difficulty of the examined problem. Researchers can implement more robust optimization algorithms by considering the difficulty of the problem. © 2024 by the authors.
Açıklama
28th International Congress on Project Management and Engineering, CIDIP 2024 -- 3 July 2024 through 4 July 2024 -- Jaen -- 204780
Anahtar Kelimeler
optimization, Resource constrained project scheduling, search domain
Kaynak
Proceedings from the International Congress on Project Management and Engineering
WoS Q Değeri
Scopus Q Değeri
Q4
