Abstract

Resource allocation project scheduling problem (RCPSP) has been one of the challenging subjects amongst researchers in the past decades. Most of the researchers in this area have used deterministic variables; however, in a real project, activities are exposed to risks and uncertainties that cause delay in project’s duration. There are some researchers that have considered the risks for scheduling; however, new metahuristics are available to solve this problem for finding better solution with less computational time. In this paper, two new metahuristic algorithms are applied for solving fuzzy resource allocation project scheduling problem (FRCPSP), known as charged system search (CSS) and colliding body optimization (CBO). The results show that both of these algorithms find reasonable solutions; however, CBO finds the results in a less computational time, with a better quality. A case study is conducted to evaluate the performance and applicability of the proposed algorithms.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call