Comparison of Heuristic Priority Rules in the Solution of the Resource-Constrained Project Scheduling Problem

TÜRKAKIN O. H., Arditi D., Manisali E.

SUSTAINABILITY, cilt.13, sa.17, 2021 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 13 Sayı: 17
  • Basım Tarihi: 2021
  • Doi Numarası: 10.3390/su13179956
  • Dergi Adı: SUSTAINABILITY
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Social Sciences Citation Index (SSCI), Scopus, Aerospace Database, CAB Abstracts, Communication Abstracts, Food Science & Technology Abstracts, Geobase, INSPEC, Metadex, Veterinary Science Database, Directory of Open Access Journals, Civil Engineering Abstracts
  • Anahtar Kelimeler: resource constrained project scheduling, heuristic methods, heuristic priority rules, ADAPTIVE SEARCH, PERFORMANCE, CLASSIFICATION, ALLOCATION, ALGORITHM, NETWORK
  • İstanbul Üniversitesi Adresli: Evet

Özet

Featured Application This study compares the existing heuristic rules using small/large networks, different resource types, relaxed/limited resource supply, and serial/parallel resource allocation procedures. Resource-constrained project scheduling (RCPS) aims to minimize project duration under limited resource availabilities. The heuristic methods that are often used to solve the RCPS problem make use of different priority rules. The comparative merits of different priority rules have not been discussed in the literature in sufficient detail. This study is a response to this research gap. It compares 17 heuristic priority rules and seeks the best performing heuristic priority rule. This is the first study ever that compares heuristic priority rules by considering combinations of variations in (1) resource allocation procedures, (2) number of activities, (3) number of resource constraints, and (4) resource supply levels. The objective is to understand the relative merits of heuristic rules used in solving the RCPS problem. The findings indicate that the "minimum late finish time" rule generates the shortest predicted project duration when used in parallel resource allocation, whereas the "minimum late start time", "minimum late finish time", and the "highest rank of positional weight 2" rules perform best in serial resource allocation. It was also found that parallel resource allocation is slightly superior to serial resource allocation in most instances.