Author:
Yang Yingying,Loxton Ryan,Rohl Andrew L.,Bui Hoa T.
Abstract
AbstractMaintenance activities are inevitable and costly in integrated mining operations. Conducting maintenance may require the whole system, or sub-units of the system, to be shut down temporarily. These maintenance activities not only disrupt the unit being shut down, but they also have consequences for inventory levels and product flow downstream. In this paper, we consider an interconnected mining system in which there are complicated maintenance relationships and stock accumulation at intermediate nodes. We propose a time-indexed mixed-integer linear programming formulation to optimize the long-term integrated maintenance plan and maximize the total throughput. We also devise an algorithm, which combines Benders decomposition and Lagrangian relaxation, to accelerate the computational speed. To validate our mathematical model, we perform simulations for a real-world case study in the iron ore industry. The results show that our method can yield better solutions than optimization solver alone in faster time.
Publisher
Springer Science and Business Media LLC
Subject
Electrical and Electronic Engineering,Control and Optimization,Mechanical Engineering,Aerospace Engineering,Civil and Structural Engineering,Software
Reference22 articles.
1. Al-Turki U, Duffuaa S, Bendaya M (2019) Trends in turnaround maintenance planning: literature review. J Qual Maintain Eng 25:253–271
2. Al-Turki UM, Duffuaa SO, Ben-Daya MA (2013) A holistic system approach for turnaround performance management. Maintenance Performance Measurement and Management, MPMM (September)
3. Amaran S, Sahinidis NV, Sharda B, Morrison M, Bury SJ, Miller S, Wassick JM (2015) Long-term turnaround planning for integrated chemical sites. Comput Chem Eng 72:145–158
4. Amaran S, Zhang T, Sahinidis NV, Sharda B, Bury SJ (2016) Medium-term maintenance turnaround planning under uncertainty for integrated chemical sites. Comput Chem Eng 84:422–433
5. Benders JF (1962) Partitioning procedures for solving mixed-variables programming problems. Numer Math 4(1):238–252