Priority rule for resource constrained project planning problem with predetermined work package durations


Creative Commons License

Cetin P., TANRIÖVER Ö. Ö.

JOURNAL OF THE FACULTY OF ENGINEERING AND ARCHITECTURE OF GAZI UNIVERSITY, cilt.35, sa.3, ss.1537-1549, 2020 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 35 Sayı: 3
  • Basım Tarihi: 2020
  • Doi Numarası: 10.17341/gazimmfd.545873
  • Dergi Adı: JOURNAL OF THE FACULTY OF ENGINEERING AND ARCHITECTURE OF GAZI UNIVERSITY
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus, Academic Search Premier, Art Source, Compendex, TR DİZİN (ULAKBİM)
  • Sayfa Sayıları: ss.1537-1549
  • Anahtar Kelimeler: Resource Constrained Project Scheduling, Project Management, Project Planning, Priority Rules, Scheduling, OPTIMIZATION ALGORITHM, SCHEDULING PROBLEM, CLASSIFICATION, MODEL
  • Ankara Üniversitesi Adresli: Evet

Özet

Project planning has a significant role in project management to progress regularly and complete the project on time. The studies for Resource Constrained Project Scheduling problem, where the available resource is limited, indicate that since there is no priority for finding the optimum solution for all problems, the choice of priority rule affects the success of planning. In this study, priority rules used for the solution of Resource Constrained Project Scheduling problem, where the duration of the work packages and the requested resources are determined, are examined. When the shortest schedule generation numbers are compared, it was seen that Maximum Area rule, which prioritizes the work package with the highest value obtained by multiplying the duration and amount of resource usage of the package, and Longest Processing Time rule, which prioritizes the work package with the highest process time, were successful. According to the average deviations, Highest Resource Usage rule, which prioritizes the most resource-consuming work package yielded successful results. Hence, two different approaches, "Area and Processing Time" and "Area and Resource Usage", have been proposed. The success of the proposed approach was measured by using PSPLib j30, j60, and j120 datasets. The results indicate that hybrid "Area and Resource Usage" rule produces good results for both in the number of shortest schedule generation and average deviations.