Large-scale multi-period precedence constrained knapsack problem: A mining application

Eduardo Moreno, Daniel Espinoza, Marcos Goycoolea

Producción científica: Contribución a una revistaArtículorevisión exhaustiva

33 Citas (Scopus)

Resumen

We study an extension of the precedence constrained knapsack problem where the knapsack can be filled in multiple periods. This problem is known in the mining industry as the open-pit mine production scheduling problem. We present a new algorithm for solving the LP relaxation of this problem and an LP-based heuristic to obtain feasible solutions. Computational experiments show that we can solve real mining instances with millions of items in minutes, obtaining solutions within 6% of optimality.

Idioma originalInglés
Páginas (desde-hasta)407-414
Número de páginas8
PublicaciónElectronic Notes in Discrete Mathematics
Volumen36
N.ºC
DOI
EstadoPublicada - ago. 2010

Huella

Profundice en los temas de investigación de 'Large-scale multi-period precedence constrained knapsack problem: A mining application'. En conjunto forman una huella única.

Citar esto