An application of Branch and Cut to open pit mine scheduling

作     者：Caccetta, L Hill, SP 

作者机构：Curtin Univ Technol Sch Math & Stat Perth WA 6845 Australia 

出 版 物：《JOURNAL OF GLOBAL OPTIMIZATION》 (全局最优化杂志)

年 卷 期：2003年第27卷第2-3期

页      面：349-365页

核心收录：

学科分类：1201[管理学-管理科学与工程(可授管理学、工学学位)] 07[理学] 070104[理学-应用数学] 0701[理学-数学] 

主　　题：Branch and Cut mixed integer linear programming mine scheduling optimization 

摘      要：The economic viability of the modern day mine is highly dependent upon careful planning and management. Declining trends in average ore grades, increasing mining costs and environmental considerations will ensure that this situation will remain in the foreseeable future. The operation and management of a large open pit mine having a life of several years is an enormous and complex task. Though a number of optimization techniques have been successfully applied to resolve some important problems, the problem of determining an optimal production schedule over the life of the deposit is still very much unresolved. In this paper we will critically examine the techniques that are being used in the mining industry for production scheduling indicating their limitations. In addition, we present a mixed integer linear programming model for the scheduling problems along with a Branch and Cut solution strategy. Computational results for practical sized problems are discussed.