By transforming the re-entrant models into models subject to parallel chain precedence constraints,we successfully get the optimal polynomial time algorithms for two objective functions of the problem,one is the total weighted completion timeΣw_jC_j,and the other is the maximum cost h_(max).
本文考虑带重入的单台机排序问题。