We consider some special cases of the NP-hard resource-constrained project scheduling problem RCPSP to minimize the makespan. We propose a solution algorithm based on the Ant Colony Optimization meta-heuristic, which was incorporated in commercial software program 1C to handle practical project scheduling problems with resource constraints.