Direct stockpile scheduling: Mathematical formulation
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 th...
- Autores:
-
Souza, Felipe Ribeiro
Soares Chaves, Leonardo
Burgarelli, Hudson
Nader, Alizeibek
Arroyo, Carlos
Alberto, Luiz
- Tipo de recurso:
- Article of journal
- Fecha de publicación:
- 2018
- Institución:
- Universidad Nacional de Colombia
- Repositorio:
- Universidad Nacional de Colombia
- Idioma:
- spa
- OAI Identifier:
- oai:repositorio.unal.edu.co:unal/68543
- Acceso en línea:
- https://repositorio.unal.edu.co/handle/unal/68543
http://bdigital.unal.edu.co/69576/
- Palabra clave:
- 62 Ingeniería y operaciones afines / Engineering
stockpile
goal programing
blending constraints
stockpile scheduling
bulk ore blending
pilas de acopio
goal programing
restricciones de mezcla
agendamiento de pilas
mezcla de concetrado
- Rights
- openAccess
- License
- Atribución-NoComercial 4.0 Internacional
id |
UNACIONAL2_ddd9993feded1c324b81ee1c5e4573bb |
---|---|
oai_identifier_str |
oai:repositorio.unal.edu.co:unal/68543 |
network_acronym_str |
UNACIONAL2 |
network_name_str |
Universidad Nacional de Colombia |
repository_id_str |
|
dc.title.spa.fl_str_mv |
Direct stockpile scheduling: Mathematical formulation |
title |
Direct stockpile scheduling: Mathematical formulation |
spellingShingle |
Direct stockpile scheduling: Mathematical formulation 62 Ingeniería y operaciones afines / Engineering stockpile goal programing blending constraints stockpile scheduling bulk ore blending pilas de acopio goal programing restricciones de mezcla agendamiento de pilas mezcla de concetrado |
title_short |
Direct stockpile scheduling: Mathematical formulation |
title_full |
Direct stockpile scheduling: Mathematical formulation |
title_fullStr |
Direct stockpile scheduling: Mathematical formulation |
title_full_unstemmed |
Direct stockpile scheduling: Mathematical formulation |
title_sort |
Direct stockpile scheduling: Mathematical formulation |
dc.creator.fl_str_mv |
Souza, Felipe Ribeiro Soares Chaves, Leonardo Burgarelli, Hudson Nader, Alizeibek Arroyo, Carlos Alberto, Luiz |
dc.contributor.author.spa.fl_str_mv |
Souza, Felipe Ribeiro Soares Chaves, Leonardo Burgarelli, Hudson Nader, Alizeibek Arroyo, Carlos Alberto, Luiz |
dc.subject.ddc.spa.fl_str_mv |
62 Ingeniería y operaciones afines / Engineering |
topic |
62 Ingeniería y operaciones afines / Engineering stockpile goal programing blending constraints stockpile scheduling bulk ore blending pilas de acopio goal programing restricciones de mezcla agendamiento de pilas mezcla de concetrado |
dc.subject.proposal.spa.fl_str_mv |
stockpile goal programing blending constraints stockpile scheduling bulk ore blending pilas de acopio goal programing restricciones de mezcla agendamiento de pilas mezcla de concetrado |
description |
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. |
publishDate |
2018 |
dc.date.issued.spa.fl_str_mv |
2018-01-01 |
dc.date.accessioned.spa.fl_str_mv |
2019-07-03T07:04:56Z |
dc.date.available.spa.fl_str_mv |
2019-07-03T07:04:56Z |
dc.type.spa.fl_str_mv |
Artículo de revista |
dc.type.coar.fl_str_mv |
http://purl.org/coar/resource_type/c_2df8fbb1 |
dc.type.driver.spa.fl_str_mv |
info:eu-repo/semantics/article |
dc.type.version.spa.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
dc.type.coar.spa.fl_str_mv |
http://purl.org/coar/resource_type/c_6501 |
dc.type.coarversion.spa.fl_str_mv |
http://purl.org/coar/version/c_970fb48d4fbd8a85 |
dc.type.content.spa.fl_str_mv |
Text |
dc.type.redcol.spa.fl_str_mv |
http://purl.org/redcol/resource_type/ART |
format |
http://purl.org/coar/resource_type/c_6501 |
status_str |
publishedVersion |
dc.identifier.issn.spa.fl_str_mv |
ISSN: 2346-2183 |
dc.identifier.uri.none.fl_str_mv |
https://repositorio.unal.edu.co/handle/unal/68543 |
dc.identifier.eprints.spa.fl_str_mv |
http://bdigital.unal.edu.co/69576/ |
identifier_str_mv |
ISSN: 2346-2183 |
url |
https://repositorio.unal.edu.co/handle/unal/68543 http://bdigital.unal.edu.co/69576/ |
dc.language.iso.spa.fl_str_mv |
spa |
language |
spa |
dc.relation.spa.fl_str_mv |
https://revistas.unal.edu.co/index.php/dyna/article/view/62642 |
dc.relation.ispartof.spa.fl_str_mv |
Universidad Nacional de Colombia Revistas electrónicas UN Dyna Dyna |
dc.relation.references.spa.fl_str_mv |
Souza, Felipe Ribeiro and Soares Chaves, Leonardo and Burgarelli, Hudson and Nader, Alizeibek and Arroyo, Carlos and Alberto, Luiz (2018) Direct stockpile scheduling: Mathematical formulation. DYNA, 85 (204). pp. 296-301. ISSN 2346-2183 |
dc.rights.spa.fl_str_mv |
Derechos reservados - Universidad Nacional de Colombia |
dc.rights.coar.fl_str_mv |
http://purl.org/coar/access_right/c_abf2 |
dc.rights.license.spa.fl_str_mv |
Atribución-NoComercial 4.0 Internacional |
dc.rights.uri.spa.fl_str_mv |
http://creativecommons.org/licenses/by-nc/4.0/ |
dc.rights.accessrights.spa.fl_str_mv |
info:eu-repo/semantics/openAccess |
rights_invalid_str_mv |
Atribución-NoComercial 4.0 Internacional Derechos reservados - Universidad Nacional de Colombia http://creativecommons.org/licenses/by-nc/4.0/ http://purl.org/coar/access_right/c_abf2 |
eu_rights_str_mv |
openAccess |
dc.format.mimetype.spa.fl_str_mv |
application/pdf |
dc.publisher.spa.fl_str_mv |
Universidad Nacional de Colombia - Sede Medellín - Facultad de Minas |
institution |
Universidad Nacional de Colombia |
bitstream.url.fl_str_mv |
https://repositorio.unal.edu.co/bitstream/unal/68543/1/62642-376698-1-PB.pdf https://repositorio.unal.edu.co/bitstream/unal/68543/2/62642-376698-1-PB.pdf.jpg |
bitstream.checksum.fl_str_mv |
0ae32a4c4bdcc986082be6ec2e0fc242 a4c43f207e9c4c0d839c53ff969f1acf |
bitstream.checksumAlgorithm.fl_str_mv |
MD5 MD5 |
repository.name.fl_str_mv |
Repositorio Institucional Universidad Nacional de Colombia |
repository.mail.fl_str_mv |
repositorio_nal@unal.edu.co |
_version_ |
1814089229252165632 |
spelling |
Atribución-NoComercial 4.0 InternacionalDerechos reservados - Universidad Nacional de Colombiahttp://creativecommons.org/licenses/by-nc/4.0/info:eu-repo/semantics/openAccesshttp://purl.org/coar/access_right/c_abf2Souza, Felipe Ribeirodd96367f-3482-4031-b79b-9dbf664f637b300Soares Chaves, Leonardo9af5d2be-4b1a-44ad-89e7-8e3b2a74979e300Burgarelli, Hudson77f9622e-5490-431a-b710-b4c511ff1c44300Nader, Alizeibek6b3c1050-e0bd-45a7-b005-bf5fa7293cca300Arroyo, Carlos5c7d34fd-c57b-4c85-816d-4248464ea2fa300Alberto, Luiz54ebba50-b0f8-4c74-863a-44c5c1a75e033002019-07-03T07:04:56Z2019-07-03T07:04:56Z2018-01-01ISSN: 2346-2183https://repositorio.unal.edu.co/handle/unal/68543http://bdigital.unal.edu.co/69576/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.Según el contexto de industria minera la programación de producción es la mejor metodología para determinar la mejor secuencia de explotación y asi obtener el mejor valor presente líquido y explotar la reserva máxima. La construcción de pilas de acopio y de mezcla representa una alternativa valiosa para la planificación de minado permitiendo garantizar la calidad del concentrado y las especificaciones de la planta de tratamiento. Para satisfacer las especificaciones de leyes y tonelaje, y reducir las variaciones las pilas de acopio y mezcla cumplen un papel importante para la planificación de corto y largo plazo. La programación linear clásica viene siendo ampliamente utilizada en problemas de mezcla presentes en la industria minera entretanto esta formulación permite apenas trabajar con una sola función objetivo en su formulación. El presente trabajo describe un sistema basado en goal programing, capaz de alcanzar las restricciones requeridas en la planificación a corto y largo plazo de forma simultánea. La formulación propuesta obtiene el mejor escenario operacional garantizando que las restricciones de costos sean respetadas. Esta formulación es útil pues da soporte a la toma de decisiones en las actividades de planificación a largo y corto plazo.application/pdfspaUniversidad Nacional de Colombia - Sede Medellín - Facultad de Minashttps://revistas.unal.edu.co/index.php/dyna/article/view/62642Universidad Nacional de Colombia Revistas electrónicas UN DynaDynaSouza, Felipe Ribeiro and Soares Chaves, Leonardo and Burgarelli, Hudson and Nader, Alizeibek and Arroyo, Carlos and Alberto, Luiz (2018) Direct stockpile scheduling: Mathematical formulation. DYNA, 85 (204). pp. 296-301. ISSN 2346-218362 Ingeniería y operaciones afines / Engineeringstockpilegoal programingblending constraintsstockpile schedulingbulk ore blendingpilas de acopiogoal programingrestricciones de mezclaagendamiento de pilasmezcla de concetradoDirect stockpile scheduling: Mathematical formulationArtículo de revistainfo:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionhttp://purl.org/coar/resource_type/c_6501http://purl.org/coar/resource_type/c_2df8fbb1http://purl.org/coar/version/c_970fb48d4fbd8a85Texthttp://purl.org/redcol/resource_type/ARTORIGINAL62642-376698-1-PB.pdfapplication/pdf385705https://repositorio.unal.edu.co/bitstream/unal/68543/1/62642-376698-1-PB.pdf0ae32a4c4bdcc986082be6ec2e0fc242MD51THUMBNAIL62642-376698-1-PB.pdf.jpg62642-376698-1-PB.pdf.jpgGenerated Thumbnailimage/jpeg9763https://repositorio.unal.edu.co/bitstream/unal/68543/2/62642-376698-1-PB.pdf.jpga4c43f207e9c4c0d839c53ff969f1acfMD52unal/68543oai:repositorio.unal.edu.co:unal/685432023-06-04 23:03:13.577Repositorio Institucional Universidad Nacional de Colombiarepositorio_nal@unal.edu.co |