This paper considers one approach to formalize the resource-constrained project scheduling problem (RCPSP) in terms of combinatorial optimiza- tion theory. The conversion of initial problem into combinatorial setting is based on interpreting each operation as an atomic entity that has a defined duration and has to be resided on the continuous time axis meet- ing additional restrictions The simplest case of continuous-time schedul- ing assumes one-to-one correspondence of resources and operations and equals to the linear programming problem setting. However real schedul- ing problems include many-to-one relations which leads to additional com- binatorial component in the formalization due to operations competition. We research how to apply typical algorithms to solve the resulted combi- natorial optimization problem: enumeration including branch-and-bound method, dynamic programming, greedy algorithms, genetic algorithms. The research ends with comparison of the results of the examined meth- ods