Limited resource work program optimum or near optimum solving of problems

Resource constrained project scheduling problem is a prevalent problem for manufacturing and construction sectors. Resource allocation is redone from the beginning in the construction sector where project management is implemented, therefore project planners may not have adequate time to obtain optimum solution. Moreover, employment of civil engineering who are talented in the optimization task is less probable in small-scale construction firms. As a result of this, resource overrun problems are solved without converging optimum solution. In this study, an exhaustive enumeration based algorithm which can solve resource constrained project scheduling problems without implementing complex optimization methods is developed. The algorithm is programmed on spreadsheet and small-scale problems are solved in order to represent the proposed algorithm can obtain the optimum solution. Search domain expands exponentially and solution time excessively prolongs when the number of activities in the project increases because the resource constrained project scheduling problem is NP-Hard. Therefore in this study small-scale problems are solved. However, as a future study speeding up the method, elimination of infeasible solutions, and parallel computing are intended. Thence solution of larger scale problems would be possible. It is considered that the construction sector may implement the proposed algorithm since among the twelve case study problems, six case studies are solved within one minute, the remaining problems are solved within reasonable time and the implementation of the proposed method does not require complex optimization algorithms. Keywords: Optimization, resource-constrained project scheduling problem, project management.