This work deals with a very generic class of scheduling problems with identical/uniform/unrelated parallel machine environment. It considers well-known attributes such as release dates, deadlines, or sequence-dependent setup times and accepts any objective function defined over job completion times. Non-regular objectives are also supported. We introduce a branch-cut-and-price algorithm for such problems that makes use of non-robust cuts, i.e., cuts which change the structure of the pricing problem. This is the first time that such cuts are employed for machine scheduling problems. The algorithm also embeds other important techniques such as strong branching, reduced cost fixing and dual stabilization. Computational experiments over literature benchmarks showed that the proposed algorithm is indeed effective and could solve many instances to optimality for the first time.

中文翻译：

---

一类并行机调度问题的精确解

这项工作处理具有相同/统一/不相关并行机环境的一类非常通用的调度问题。它考虑了众所周知的属性，例如发布日期、截止日期或与序列相关的设置时间，并接受在作业完成时间上定义的任何目标函数。还支持非常规目标。我们为此类问题引入了分支切割和定价算法，该算法利用非稳健切割，即改变定价问题结构的切割。这是第一次将这种切割用于机器调度问题。该算法还嵌入了其他重要技术，例如强分支、降低成本固定和双重稳定。