This paper considers a maintenance scheduling problem on a single machine with a fixed job sequence involving job-dependent, stochastic deterioration. If the machine breaks down, then a time-consuming emergency maintenance activity needs to be conducted. Instead, planned maintenance activities can be conducted between jobs in order to improve the machine’s state and, thus, prevent the machine from breaking down. We distinguish two types of machines differing in the flexibility regarding the point of time when the maintenance activities need to be scheduled. The goal is to minimize the total expected completion time of jobs. We formalize two optimization problems, analyze their computational complexities, develop exact solution approaches, and conduct a computational study. Here, we show that our approaches can solve large instances to optimality within short run times and we analyze the advantage gained by planning maintenance activities depending on the actual state of the machine.

中文翻译：

---

根据与工作相关的随机机器退化来安排维护活动


本文考虑了具有固定作业序列的单台机器上的维护调度问题，涉及作业相关的随机恶化。如果机器发生故障，则需要进行耗时的紧急维护活动。相反，可以在作业之间进行有计划的维护活动，以改善机器的状态，从而防止机器发生故障。我们区分两种类型的机器，它们在需要安排维护活动的时间点方面具有不同的灵活性。目标是尽量减少作业的总预期完成时间。我们形式化两个优化问题，分析它们的计算复杂性，开发精确的解决方法，并进行计算研究。在这里，我们展示了我们的方法可以在短时间内解决大型实例的最优问题，并且我们分析了根据机器的实际状态规划维护活动所获得的优势。