A strengthened formulation and cutting planes for the open pit mine production scheduling problem

Bley, Andreas; Boland, Natashia; Fricke, Christopher; Froyland, Gary

doi:10.1016/j.cor.2009.12.008

Cited by 96 publications

(32 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Different methods have been applied to solve the deterministic version of the problem, which assumes that all the problem parameters are well known. These methods can be classified into three categories: exact methods (Dagdelen and Johnson, 1986;Caccetta and Hill, 2003;Ramazan, 2007;Boland et al, 2009;Bley et al, 2010), heuristic and metaheuristic methods (Gershon, 1987;Denby and Schofield, 1994;Ferland et al, 2007;Chatterjee et al, 2010), and hybrid methods (Tolwinski and Underwood, 1996;Sevim and Lei, 1998;Moreno et al, 2010). However, the uncertain nature of the problem is ignored in the deterministic version of the MPSP, resulting in misleading assessments (Ravenscroft, 1992;Dowd, 1994;Dimitrakopoulos et al, 2002;Godoy and Dimitrakopoulos, 2004).…”

Section: Introductionmentioning

confidence: 99%

A variable neighbourhood descent algorithm for the open-pit mine production scheduling problem with metal uncertainty

Lamghari

Dimitrakopoulos

Ferland

2014

Journal of the Operational Research Society

View full text Add to dashboard Cite

Uncertainty is an inherent aspect of the open-pit mine production scheduling problem (MPSP); however, little is reported in the literature about solution methods for the stochastic versions of the problem. In this paper, two variants of a variable neighbourhood descent algorithm are proposed for solving the MPSP with metal uncertainty. The proposed methods are tested and compared on actual large-scale instances, and very good solutions, with an average deviation of less than 3% from optimality, are obtained within a few minutes up to a few hours.

show abstract

Section: Introductionmentioning

confidence: 99%

A variable neighbourhood descent algorithm for the open-pit mine production scheduling problem with metal uncertainty

Lamghari

Dimitrakopoulos

Ferland

2014

Journal of the Operational Research Society

View full text Add to dashboard Cite

show abstract

“…Na sequência, gera-se um índice de priorização de recuperação de cada pilha (que estabelece a sequência das pilhas a serem recuperadas), o qual inicia pelo cálculo do índice de qualidade de cada pilha (Qi). Para cada uma das pilhas, deriva-se um critério (parâmetro) de qualidade e, através da aplicação do fator perda de Taguchi [1], calcula-se o OQEOverall Quality of Production Effectiveness (Qualidade Global Efetiva), onde cada pilha recebe uma nota proporcional à sua qualidade. Na sequência, gera-se uma matriz de setup contemplando os tempos de trânsito da recuperadora entre as pilhas; tal matriz também comporta restrições físicas e dificuldade de locomoção das máquinas recuperadoras entre as pilhas a serem recolhidas.…”

Section: Introductionunclassified

Proposta De Heurística De Sequenciamento Para Retomada De Pilhas De Minério Em Pátios De Estocagem

Silva¹

2017

Anais Dos Seminários De Redução, Minério De Ferro E Aglomeração

View full text Add to dashboard Cite

ResumoEste artigo propõe uma heurística de sequenciamento para a retomada de pilhas de minério (entendidas como tarefas a serem sequenciadas) nos seus respectivos pátios através de um índice de priorização de pilhas (IP). Tal índice apoia-se em fatores importantes para as operações de pátios de estocagem, como capacidade das recuperadoras (máquinas), qualidade do minério, tempo de residência e tempo de deslocamento das recuperadoras entre pilhas (setup). O método proposto foi aplicado em dois pátios, duas máquinas recuperadoras e doze pilhas e a sequência de recuperação sugerida pelo método foi considerada coerente por especialistas de processo da empresa mineradora. Palavras-chave: Heurística; Sequenciamento; Pátios de estocagem. PROPOSAL OF HEURISTIC OF SEQUENCING FOR RECLAIMING ORE PILES IN STOCKYARDS AbstractThis work aims to propose a heuristic for sequencing reclaiming ore piles (seen as tasks to be sequenced) in their respective stockyard by applying a pile prioritization index (IP). This index rely on relevant factors to the stockyard operation, including capacity of reclaimers (machines), ore quality, time of ore residence, and travel time of reclaimers between piles (setup). The main contribution relied on the proposition of a new index for sequencing pile recovering that avoids the use of subjective rules-ofthumb typically applied in the sector. The proposed heuristic yielded satisfactory results when assessed by process experts.

show abstract

“…To illustrate this, we consider the following scheduling model, which is a special case of the model considered by Bley et al (2010).…”

Section: The Maximum Flow Formulationmentioning

confidence: 99%

“…This is the process of deciding how and when to mine the blocks so as to maximize profit (typically the net present value), while obeying the wall slope and precedence constraints, as well as various mining capacity restrictions. Contributions within open-pit mine scheduling, from the view of mathematical optimization, have been given by Gershon (1983), Dagdelen and Johnson (1986), Caccetta and Hill (2003), Ramazan (2007), Rafiee and Asghari (2008), Bley et al (2010), and Cullenbine et al (2011), among others.…”

Section: Introductionmentioning

confidence: 99%

A maximum flow formulation of a multi-period open-pit mining problem

2014

View full text Add to dashboard Cite

We consider the problem of finding an optimal mining sequence for an open pit during a number of time periods subject to only spatial and temporal precedence constraints. This problem is of interest because such constraints are generic to any open-pit scheduling problem and, in particular, because it arises as a Lagrangean relaxation of an open-pit scheduling problem. We show that this multi-period open-pit mining problem can be solved as a maximum flow problem in a time-expanded mine graph. Further, the minimum cut in this graph will define an optimal sequence of pits. This result extends a well-known result of J.-C. Picard from 1976 for the open-pit mine design problem, that is, the single-period case, to the case of multiple time periods.

show abstract

A strengthened formulation and cutting planes for the open pit mine production scheduling problem

Cited by 96 publications

References 8 publications

A variable neighbourhood descent algorithm for the open-pit mine production scheduling problem with metal uncertainty

A variable neighbourhood descent algorithm for the open-pit mine production scheduling problem with metal uncertainty

Proposta De Heurística De Sequenciamento Para Retomada De Pilhas De Minério Em Pátios De Estocagem

A maximum flow formulation of a multi-period open-pit mining problem

Contact Info

Product

Resources

About