Project scheduling problem with resource constraints and activities interruption using Bees algorithm

Abstract

Project scheduling problem with resources constraint is a well-known problem in the field of project management. The applicable nature of this problem has caused the researchers’ tendency to it. In this study, project scheduling with resource constraints and the possibility of interruption of project activities as well as renewable resources constraint has been also applied along with a case study on construction projects. Construction projects involve complex levels of work. Making wrong decisions in selecting methods and how to allocate the necessary resources such as manpower and equipment can lead to the results such as increasing the predetermined cost and time. According to NP-Hard nature of the problem, it is very difficult or even impossible to obtain optimal solution using optimization software and traditional methods. In project scheduling using CPM method, critical path is widely used; however, in this method, the resource constraints is not considered. Project Scheduling seek proper sequence for doing the project activities. This study has been conducted using Bees meta-heuristic algorithm, with the aim of optimizing the project completion time. Finally, the results obtained from three algorithms and GAMS software shows that this algorithm has better performance than and the solution among the other algorithms and has achieved the accurate solutions. [1] Critical Path Method

Keywords

• planning
• project scheduling
• activities interruption
• bees algorithm
• resource constraint