• Login
    View Item 
    •   Home
    • Theses & Dissertations
    • 2013 - Mines Theses & Dissertations
    • View Item
    •   Home
    • Theses & Dissertations
    • 2013 - Mines Theses & Dissertations
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Browse

    All of Mines RepositoryCommunitiesPublication DateAuthorsTitlesSubjectsThis CollectionPublication DateAuthorsTitlesSubjects

    My Account

    Login

    Mines Links

    Arthur Lakes LibraryColorado School of Mines

    Statistics

    Display Statistics

    Optimization-based decomposition heuristic for solving complex underground mine scheduling problems, An

    • CSV
    • RefMan
    • EndNote
    • BibTex
    • RefWorks
    Thumbnail
    Name:
    OSullivan_mines_0052E_10352.pdf
    Size:
    7.345Mb
    Format:
    PDF
    Description:
    An optimization-based decomposition ...
    Download
    Author
    O'Sullivan, Donal
    Advisor
    Newman, Alexandra M.
    Date issued
    2013
    Keywords
    optimal production scheduling
    mining
    mine production scheduling
    integer programming applications
    Mineral industries -- Economic aspects
    Production scheduling -- Mathematical models
    Heuristic algorithms
    Integer programming
    Mathematical optimization
    
    Metadata
    Show full item record
    URI
    https://hdl.handle.net/11124/12212
    Abstract
    Underground mine production scheduling possesses mathematical structure similar to and yields many of the same challenges as general scheduling problems. That is, binary variables represent the time at which various activities are scheduled. Typical objectives seek to minimize costs or some measure of production time, or to maximize net present value; two principal types of constraints exist: (i) resource constraints, which limit the number of activities committed to a time period based on the availability of a given supply and on the amount of that supply required to perform the activity, and (ii) precedence constraints, which dictate the order in which activities must be completed. In our setting, we maximize "discounted metal production" for the remaining life of an underground lead and zinc mine that uses three different underground methods to extract the ore. Resource constraints limit the grade, tonnage, and backfill paste (used for structural stability) in each time period, while precedence constraints enforce the sequence in which extraction (and backfill) is performed in accordance with the underground mining methods used. We tailor existing exact and heuristic approaches to reduce model size, and develop an optimization-based decomposition heuristic; both of these methods transform a computationally intractable problem to one for which we obtain solutions in seconds, or, at most, hours for problem instances based on data sets from the Lisheen mine near Thurles, Ireland. Our solution adds value to the Lisheen mining operation by: (i) shifting metal production forward in the schedule; (ii) reducing waste mining and backfilling delays; (iii) avoiding expensive mill-halting drops in ore production; and (iv) enabling smoother workforce management. Our modeling approach could be applied to other mines, especially to operations with flat lying deposits that practice retreat, i.e., room-and-pillar, mining, such as coal mines, and to mines that are approaching the end of their operational life.
    Rights
    Copyright of the original work is retained by the author.
    Collections
    2013 - Mines Theses & Dissertations

    entitlement

     
    DSpace software (copyright © 2002 - 2023)  DuraSpace
    Quick Guide | Contact Us
    Open Repository is a service operated by 
    Atmire NV
     

    Export search results

    The export option will allow you to export the current search results of the entered query to a file. Different formats are available for download. To export the items, click on the button corresponding with the preferred download format.

    By default, clicking on the export buttons will result in a download of the allowed maximum amount of items.

    To select a subset of the search results, click "Selective Export" button and make a selection of the items you want to export. The amount of items that can be exported at once is similarly restricted as the full export.

    After making a selection, click one of the export format buttons. The amount of items that will be exported is indicated in the bubble next to export format.