In construction projects, critical path method (CPM) has been mainly used for project scheduling and planning in the past. The main objective of CPM is to find critical activities and schedule the project in such a way that the project makespan is minimized. Resource allocation project scheduling problem has been one of the most popular issues among construction management researchers in the past decades. Resource leveling problem in the real world is also important and should be considered in the planning of a project. On the other side, since these two objectives have opposite goals in the projects, considering both of these objectives simultaneously has always been a challenging problem. In this paper, we try to solve these problems at the same time. For this purpose, two new metaheuristic algorithms so-called colliding body optimization and charged system search are utilized. Two case examples are solved to show the applicability and performance of the considered algorithms.