【摘要】 讨论了工件的加工时间依赖于工件位置的树约束单机排序问题,给出了目标函数为最大完工时间的多项式算法.结果表明,最大家庭树中的工件优先于其它家庭树中的工件加工,并且其工件要连续加工所得到的排序为最优排序.更多还原

【Abstract】 The single machine scheduling problem with tree-structured and processing time dependent on their position in the sequence is considered.A polynomial algorithm of makespan is obtained.In this case,jobs in the maximal family tree should be proceed prior to other jobs in family tree,the optimal schedule is obtained if their jobs aren’t be preempted by the other jobs.更多还原