Abstract

SOUZA, Felipe et al. Direct stockpile scheduling: Mathematical formulation. Dyna rev.fac.nac.minas [online]. 2018, vol.85, n.204, pp.296-301. ISSN 0012-7353.  https://doi.org/10.15446/dyna.v85n204.62642.

In a mining context, production scheduling’s main objective is to determine the best mining sequence of blocks to achieve the largest net present value and to maximize ore reserve exploitation. Stockpiling and blending procedures may represent very helpful alternatives for mine planning to ensure the ore quality and amount required by the processing plant. In order to satisfy industrial requirements of grades and tones, reducing stockpile fluctuations may represent a very important tool especially for medium and short term mine planning. Classical linear programing has been widely used to model blending problems at the mining industry, however this formulation allows only one objective formulation. The current work describes a system based on goal programing able to reach blending constraints desired by short/medium term planning. The proposed formulation achieves the best schedule scenario, ensuring cost constrains are respected. Hence, this study aims to provide support for both short and long term mine planning.

Keywords : stockpile; goal programing; blending constraints; stockpile scheduling; bulk ore blending.

        · abstract in Spanish     · text in English     · English ( pdf )