In recent years, metaheuristic algorithms for resource constrained project scheduling problems(RCPSPs) which can obtain satisficing solutions with small computational cost have been studied. In this paper, we propose CATS(Critical Activity based Tabu Search) and SFTS(Space Filling Tabu Search) as new tabu search algorithms for the RCPSP. CATS focuses on critical or nearly critical activities, and SFTS makes use of blank spaces of schedules.We confirm efficiency of our algorithms through computational experiments.
