证明在一定条件下，与地理相关数据的最优显示问题在多项式时间内可解。
It is intended to prove that the of the optimum displaying problems related with geometry data solution can be found in polynomial time, under certain condition.
讨论了工件加工时间随开工时间线性增加的成组排序问题，考虑的目标函数是总完工时间，在成组技术的限制下，总完工时间问题是多项式时间可解的。
In these two problems, the job processing time is a linear decreasing function of its starting time, the objective is to minimize the total completion time.
讨论了工件加工时间随开工时间线性增加的成组排序问题，考虑的目标函数是总完工时间，在成组技术的限制下，总完工时间问题是多项式时间可解的。
In these two problems, the job processing time is a linear decreasing function of its starting time, the objective is to minimize the total completion time.
应用推荐