Skip Navigation

IMA Journal of Management Mathematics 1996 7(3):247-270; doi:10.1093/imaman/7.3.247
© 1996 by Institute of Mathematics and its Applications
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by TOLWTNSKI, B.
Right arrow Articles by UNDERWOOD, R.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

A scheduling algorithm for open pit mines

BOLESLAW TOLWTNSKI and ROBERT UNDERWOOD

Department of Mathematical and Computer Sciences, Colorado School of Mines Golden, Colorado 80401

An open pit (opencast) mine can be described by a three-dimensional array of blocks, each of which is assigned a number of values defining its characteristics. Scheduling an open pit consists in finding a sequence in which the blocks should be removed from the mine in order to maximize the total discounted profit from the mine subject to a variety of technical and economic constraints. This paper proposes to model the mine-scheduling problem as one of sequential optimization, and develops an algorithm for its solution. To overcome the difficulty caused by an extremely large number of states in the problem at hand, we consider a technique which is related to dynamic programming but avoids the complete enumeration of the state space. Our algorithm is a combination of this technique with powerful heuristics derived from the specific properties of open pit mining.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.