Mine scheduling optimization with mixed integer programming

A mixed-integer formulation of the mine scheduling problem is discussed and applied for the purpose of optimizing both the mine production sequencing and the mill blending and processing problems simultaneously. Previous attempts at solving these problems separately, although successful, fail to take into account the interrelationships between these problems. Project structure serves as the outline of this paper. Generalized in its organization, this concept is useful for long, intermediate, and short range scheduling. Actual applications that show the concept also is applicable to mining a variety of ore are mentioned.