In a previous work we introduced a global StockingCost constraint to compute the total number of periods between the production periods and the due dates in a multi-order capacitated lot-sizing problem. Here we consider a more general case in which each order can have a different per period stocking cost and the goal is to minimise the total stocking cost. In addition the production capacity, limiting the number of orders produced in a given period, is allowed to vary over time. We propose an efficient filtering algorithm in O(n log n) where n is the number of orders to produce. On a variant of the capacitated lot-sizing problem, we demonstrate experimentally that our new filtering algorithm scales well and is competitive wrt the StockingCost constraint when the stocking cost is the same for all orders.

中文翻译：

---

项目相关的库存成本约束

在先前的工作中，我们引入了一个全局StockingCost约束来计算多级容量批量问题中生产期与到期日之间的期总数。在这里，我们考虑一种更一般的情况，其中每个订单的每个时期的库存成本可能不同，目标是使总库存成本最小化。另外，允许限制给定时期内生产的订单数量的生产能力会随时间变化。我们在O（n log n）中提出了一种有效的过滤算法，其中n是要产生的订单数。在容量较大的批量问题的一个变体上，我们通过实验证明了，当所有订单的库存成本都相同时，我们的新过滤算法可以很好地扩展并且与StockingCost约束相比具有竞争力。