Abstract Manual short-term scheduling in underground mines is a time-consuming and error-prone activity. In this work, we present a Constraint Programming approach capable of automating the short-term scheduling process in a cut-and-fill mine. The approach extends previous work by accounting for fleet travel times, and thus captures an important aspect of the real-world machine scheduling problem. We introduce two models: one that directly solves the original interruptible scheduling problem, and one that is based on solving a related uninterruptible scheduling problem and transforming its solution back to the original domain. Large Neighborhood Search is also employed with a domain-specific neighborhood definition that helps to find high-quality schedules faster. Problem instances derived from an operational mine are used to demonstrate the efficacy of our approach.

中文翻译：

---

使用约束规划和大型邻域搜索的移动机器地下矿山调度

摘要 地下矿山的人工短期调度是一项耗时且容易出错的活动。在这项工作中，我们提出了一种约束编程方法，该方法能够自动执行随挖随填矿中的短期调度过程。该方法通过考虑车队旅行时间扩展了先前的工作，从而捕获了现实世界机器调度问题的一个重要方面。我们引入了两种模型：一种是直接解决原始的可中断调度问题，另一种是基于解决相关的不可中断调度问题并将其解决方案转换回原始域。大型邻域搜索还与特定领域的邻域定义一起使用，有助于更快地找到高质量的时间表。