基于决策图的并行机调度流模型
A flow-based formulation for parallel machine scheduling using decision diagrams
摘要：
提出了一种新的基于流的无空闲时间的同向并行机调度算法。制定的决策图的帮助下，表示尊重特定的排序规则的所有作业序列构建。这些规则依赖于一个分区的规划视野，一般不统一，期间，并不排除所有的最佳解决方案，但他们约束的解决方案，坚持一个规范的形式。新的配方有许多变量和约束条件，因此，我们应用Dantzig-Wolfe分解，以计算在合理的时间内的线性规划松弛，由此产生的下限是强于从经典的时间索引的配方的界限。我们开发了一个分支和价格的框架，解决了几个例子，从文献中的第一次。通过一系列的计算实验，我们将新公式与时间指数公式和弧时间指数公式进行了比较。
英文摘要：
We present a new flow-based formulation for identical parallel machine scheduling with a regular objective function and without idle time. The formulation is constructed with the help of a decision diagram that represents all job sequences that respect specific ordering rules. These rules rely on a partition of the planning horizon into, generally non-uniform, periods and do not exclude all optimal solutions, but they constrain solutions to adhere to a canonical form. The new formulation has numerous variables and constraints, and hence we apply a Dantzig-Wolfe decomposition in order to compute the linear programming relaxation in reasonable time; the resulting lower bound is stronger than the bound from the classical time-indexed formulation. We develop a branch-and-price framework that solves several instances from the literature for the first time. We compare the new formulation with the time-indexed and arc-time-indexed formulation by means of a series of computational experiments.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
