Discrete-time, Mixed-Integer Linear Programming (MILP) models are frequently used for scheduling problems in which the utilization of resources and/or the determination of costs and revenues imply complex time-dependent functions that are directly related to the development of the tasks. One of the main challenges in these models is to deal with changeovers, which are one of the most complicating features. In this short note, we provide some insight to effectively model the scheduling of operations by means of the concept of campaigns. We show that this allows to reduce the computational burden by three orders of magnitude when compared to conventional approaches.

中文翻译：

---

通过引入活动概念来加强离散时间计划制定

离散时间混合整数线性规划（MILP）模型经常用于计划问题，在这些问题中，资源的利用和/或成本和收入的确定意味着与时间相关的，与时间直接相关的复杂功能。这些模型的主要挑战之一是应对转换，转换是最复杂的功能之一。在本简短说明中，我们提供一些见解，以借助活动的概念有效地对运营计划进行建模。我们证明，与传统方法相比，这可以减少三个数量级的计算负担。