The article described the experience of using constraint satisfaction methods in solving medium-term mining planning problems. Medium-Term Mining Planning is a complex problem combining the features of such classic scheduling problems as Vehicle Scheduling, Time Tabling and Job Shop Scheduling. In addition, solving practically significant mining planning problems is complicated by the fact that they involve flexible accounting and analysis of a variety of heterogeneous additional constraints from subject domain and involve the use of large computing resources. These constraints include productivity, available operating time of the equipment, sequence of mining units, planned mining rates etc. These features make it difficult to apply traditional methods of Operation Research, in particular, Integer Linear Programming methods. The report presents a formalization of this problem in Constraint Programming Paradigm, as well as author’s approach to its solution. Methods of propagation of specialized technological constraints have been developed and heuristics have been proposed to accelerate the process of finding solutions. The research results have been integrated into the mining support software system MineFrame.