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).
本文考虑带重入的单台机排序问题。
本网站所收集内容来自网友分享仅供参考，实际请以各学校实际公布信息为主！内容侵权及错误投诉：1553292129@qq.com
CopyRight © 2020-2025 优校网[www.youxiaow.com]版权所有 All Rights Reserved. 浙ICP备2024058711号