Curtin University Homepage
  • Library
  • Help
    • Admin

    espace - Curtin’s institutional repository

    JavaScript is disabled for your browser. Some features of this site may not work without it.
    View Item 
    • espace Home
    • espace
    • Curtin Research Publications
    • View Item
    • espace Home
    • espace
    • Curtin Research Publications
    • View Item

    Literature review

    Access Status
    Fulltext not available
    Authors
    Burt, C.
    Caccetta, Louis
    Date
    2018
    Type
    Book Chapter
    
    Metadata
    Show full item record
    Citation
    Burt, C. and Caccetta, L. 2018. Literature review. In: Burt C., Caccetta L. (eds), Equipment Selection for Mining: With Case Studies, pp. 25-51. Cham.: Springer.
    Source Title
    Equipment Selection for Mining: With Case Studies
    DOI
    10.1007/978-3-319-76255-5_3
    School
    School of Electrical Engineering, Computing and Mathematical Science (EECMS)
    URI
    http://hdl.handle.net/20.500.11937/67126
    Collection
    • Curtin Research Publications
    Abstract

    © 2018, Springer International Publishing AG. In this chapter, we present a detailed literature review of the equipment selection problem in surface mining as well as the closely related equipment selection problem in the construction industry. We review the modelling and solution methods that have emerged in both the mining and operations research literature. We also consider a number of closely related problems such as shovel-truck productivity, mining method selection, scheduling, dispatching and allocation problems. Our review considers a broad range of modelling and solution approaches that can or have been used for these related problems.

    Related items

    Showing items related by title, author, creator and subject.

    • Algorithms for some hard knapsack problems
      Kulanoot, Araya (2000)
      The Knapsack Problems are among the simplest integer programs which are NP-hard. Problems in this class are typically concerned with selecting from a set of given items, each with a specified weight and value, a subset ...
    • Optimisation of large scale network problems
      Grigoleit, Mark Ted (2008)
      The Constrained Shortest Path Problem (CSPP) consists of finding the shortest path in a graph or network that satisfies one or more resource constraints. Without these constraints, the shortest path problem can be solved ...
    • Effective computational models for timetabling problem
      Aizam, Nur Aidya Hanum (2013)
      Timetabling is a table of information showing when certain events are scheduled to take place. Timetabling is in fact very essential in making sure that all events occur in the time and place required. It is critical in ...
    Advanced search

    Browse

    Communities & CollectionsIssue DateAuthorTitleSubjectDocument TypeThis CollectionIssue DateAuthorTitleSubjectDocument Type

    My Account

    Admin

    Statistics

    Most Popular ItemsStatistics by CountryMost Popular Authors

    Follow Curtin

    • 
    • 
    • 
    • 
    • 

    CRICOS Provider Code: 00301JABN: 99 143 842 569TEQSA: PRV12158

    Copyright | Disclaimer | Privacy statement | Accessibility

    Curtin would like to pay respect to the Aboriginal and Torres Strait Islander members of our community by acknowledging the traditional owners of the land on which the Perth campus is located, the Whadjuk people of the Nyungar Nation; and on our Kalgoorlie campus, the Wongutha people of the North-Eastern Goldfields.