We consider several heuristic algorithms for scheduling maintenance of locomotives in the depot consisting of three observation ditches. Here six algorithms for scheduling maintenance of locomotives in the depot for some cases are presented. These algorithms give opportunity to set priority of service requirements by various permutations. We carried out computer experiments to calculate the absolute error in comparison with the method of iteration giving the absolute minimum of the objective function. As a result the proposed algorithms provide scheduling for less computer time with small errors compared to standard optimizers as IBM IlogCplex.