Scheduling With Fixed Maintenance, Shared Resources And Nonlinear Feedrate Constraints: A Mine Planning Case Study

INTEGRATION OF AI AND OR TECHNIQUES IN CONSTRAINT PROGRAMMING(2015)

引用 3|浏览24
暂无评分
摘要
Given a short term mining plan, the task for an operational mine planner is to determine how the equipment in the mine should be used each day. That is, how crushers, loaders and trucks should be used to realise the short term plan. It is important to achieve both grade targets (by blending) and maximise the utilisation (i.e., throughput) of the mine. The resulting problem is a non-linear scheduling problem with maintenance constraints, blending and shared resources. In this paper, we decompose this problem into two parts: the blending, and the utilisation problems. We then focus our attention on the utilisation problem. We examine how to model and solve it using alternative approaches: specifically, constraint programming, MIQP and MINLP. We provide a repair heuristic based on an outer-approximation, and empirically demonstrate its effectiveness for solving the real-world instances of operational mine planning obtained from our industry partner.
更多
查看译文
关键词
Schedule Problem, Constraint Programming, Maintenance Task, Industry Partner, Mixed Integer Nonlinear Programming
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要