Abstract: Critical chain method requires the non-critical activities to be executed as late as possible. However, in some project cases, such as software development projects, the critical chain method might result in the higher risk of project delay. In this study, we present a revised critical chain method for the projects where all the activities should be scheduled as early as possible. The revised critical chain method, defined as the Active Critical Chain Method (ACCM), is generated based on the active baseline schedule, where all activities are scheduled as early as possible. The generation procedure of ACCM schedule is illustrated, including searching critical chain and setting buffers. Referring to the conceptual models of the Resource Constrained Project Scheduling Problems (RCPSPs), we propose the scheduling problem of ACCM and formulate it. Since, the scheduling problem of ACCM is a NP hard problem, we resort to heuristics and the Genetic Algorithm (GA) is investigated to solve it. Finally, a full computation experiment is performed to determine the parameter configuration and effectiveness of the algorithm is verified by some modified benchmark instances.