具有恶化效应和释放时间约束的单机成组调度问题研究

摘要

本文研究具有恶化效应和释放时间约束的单机成组调度问题。工件的实际加工时间和不同组之间的切换时间是其开始加工时间的简单线性函数。本文以最小化工件的最大完工时间为目标函数。证明了该问题存在多项式求解算法，并给出了相应的多项式算法。最后，通过实例验证了此算法的有效性。%This paper studies the single machine group scheduling with deteriorating effect and constraint of releasing time. There is a simple linear function between the actual processing time of the workpiece, the switching time in different groups and its starting time of the work. This paper takes the maximum completion time of the minimize workpiece as the objective function to prove that there exists a polynomial algorithm for solving this problem, and the corresponding polynomial algorithm is given. Finally, the effectiveness of this algorithm is verified by the examples.