并行机排序问题中流时间最小化的过滤规则
Filtering Rules for Flow Time Minimization in a Parallel Machine Scheduling Problem
摘要：
本文研究了具有资格约束的多台平行机上不同工件族的排序问题。起源于半导体制造业，这种约束在同一家族的两个作业的执行之间施加了一个时间阈值。否则，该机器将不适用于此系列。我们的目标是尽量减少流动时间和取消资格的数量。最近，一个有效的约束规划模型已被提出。然而，当优先考虑的流动时间的目标，可以提高模型的效率。本文采用了多项式时间算法，最小化流时间的单机松弛不考虑不合格。利用该算法可以得到模型中不同变量的过滤规则。实验结果表明，这些规则的有效性。与文献中的混合整数线性规划相比，提高了竞争力。
英文摘要：
This paper studies the scheduling of jobs of different families on parallel machines with qualification constraints. Originating from semiconductor manufacturing, this constraint imposes a time threshold between the execution of two jobs of the same family. Otherwise, the machine becomes disqualified for this family. The goal is to minimize both the flow time and the number of disqualifications. Recently, an efficient constraint programming model has been proposed. However, when priority is given to the flow time objective, the efficiency of the model can be improved. This paper uses a polynomial-time algorithm which minimize the flow time for a single machine relaxation where disqualifications are not considered. Using this algorithm one can derived filtering rules on different variables of the model. Experimental results are presented showing the effectiveness of these rules. They improve the competitiveness with the mixed integer linear program of the literature.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
