-
摘要: 把工件之间不带前后约束的延误排序的后移算法移植到带有前后约束的情况, 提出一个多项式时间的近似算法. 这个算法可以快速地得到这种延误问题的近似解.Abstract: For the total tardiness scheduling with precedence constraints, an approximation algorithm with polynomial complexity was presented bytransplanting the backward-shift algorithm of the case without precedence constraints. The new algorithm can get an approximation solution for the scheduling quickly.
点击查看大图
计量
- 文章访问数: 2712
- HTML全文浏览量: 15
- PDF下载量: 267
- 被引次数: 0