A Robust Solution To Resource-Constraint Project Scheduling Problem

This paper aims to propose a solution to the resource-constraint project scheduling problem (RCPSP). RCPSP is a significant scheduling problem in project management. Currently, there are insufficient studies dealing with the robustness of RCPSP. This paper improves the robustness of RCPSP and develops a Robust RCPSP, namely RRCSP. RRCSP is structured with relaxing a fundamental assumption that is 'the tasks start on time as planned'. Relaxing this assumption makes the model more realistic. The proposed solution minimizes the makespan while maximizing the robustness. Maximizing the robustness requires maximizing floating time of activities (it is NP hard). This creates more stability in the project finishing time. RCPSP stands as the root cause of many other problems such as multi-mode resource-constrained project scheduling problems (MRCPSP), multi-skill resource-constrained project scheduling problem (MSRCPSP), or similar problems and hence proposing a solution to this problem contributes to pave a new line for future research in other mentioned areas. The applicability of the proposed model is examined through a numerical example.