IDEAS home Printed from https://ideas.repec.org/h/spr/isochp/978-1-4614-9056-2_14.html
   My bibliography  Save this book chapter

Mine Planning Above and Below Ground: Generating a Set of Pareto-Optimal Schedules Considering Risk and Return

In: Essays in Production, Project Planning and Scheduling

Author

Listed:
  • Candace A. Yano

    (The University of California - Berkeley)

  • Carson McFadden

    (Watarah Advisors)

Abstract

Recent years have seen increasing efforts to incorporate risk and uncertainty into optimal and heuristic methods for mine planning and scheduling. The recent volatility in the prices of metals and minerals has provided further impetus for developing new methods that facilitate integrated optimization and risk analysis in mining. We consider a long-term problem of determining a plan for above- and underground mining, allowing for different ways in which the material can be extracted, such as choice of cutoff grade and mining speed. We develop a methodology based on a longest-path network framework that allows us to identify the mining plans that produce the k highest values of expected profit, where k can be chosen by the decision-maker. We couple this with a methodology for evaluating each of these plans with respect to various measures of risk, such as variance, probability of achieving a profit target, or conditional value-at-risk. The framework is easily extendible to other risk measures. The methodology provides a means to construct a set of Pareto-optimal solutions with expected profit and the selected risk measure as the two performance metrics. We illustrate our approach using a simple example in which the risk measure is value-at-risk (VaR).

Suggested Citation

  • Candace A. Yano & Carson McFadden, 2014. "Mine Planning Above and Below Ground: Generating a Set of Pareto-Optimal Schedules Considering Risk and Return," International Series in Operations Research & Management Science, in: P. Simin Pulat & Subhash C. Sarin & Reha Uzsoy (ed.), Essays in Production, Project Planning and Scheduling, edition 127, chapter 14, pages 343-356, Springer.
  • Handle: RePEc:spr:isochp:978-1-4614-9056-2_14
    DOI: 10.1007/978-1-4614-9056-2_14
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:isochp:978-1-4614-9056-2_14. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.