加工时间具有学习效应的链约束单机排序问题

Single machine scheduling problem with chain constraints and the learning effect of processing time

研究了工件的加工时间具有学习效应的链约束单机排序问题,在链可中断和不可中断两种情况下,均给出了目标函数为极小化最大完工时间的多项式算法。

This paper considers the single machine scheduling problem with chain constraints in which workpiece processing time has learning effect. The polynomial algorithm of objective function with minimum maximum makespan is given for the non-preemptive chains and preemptive chains.