New integer programming models for tactical and strategic underground production scheduling

B. King, M. Goycoolea, A. Newman

Resultado de la investigación: Contribución a una publicación especializadaArtículo

10 Citas (Scopus)

Resumen

In this paper, we consider an underground production scheduling problem consisting of determining the proper time interval or intervals in which to complete each mining activity so as to maximize a mine's discounted value while adhering to precedence, activity durations, and production and processing limits. We present two different integer programming formulations for modeling this optimization problem. Both formulations possess a resource-constrained project scheduling problem structure. The first formulation uses a fine time discretization and is better suited for tactical mine scheduling applications. The second formulation, which uses a coarser time discretization, is better suited for strategic scheduling applications. We illustrate the strengths and weaknesses of each formulation with examples.

Idioma originalInglés
Páginas37-42
Número de páginas6
Volumen69
N.º3
Publicación especializadaMining Engineering
DOI
EstadoPublicada - mar. 2017

Huella

Profundice en los temas de investigación de 'New integer programming models for tactical and strategic underground production scheduling'. En conjunto forman una huella única.

Citar esto