A typical heuristic algorithm, TDS, can generate optimalschedule in scheduling length under optimality condition.
TDS等典型算法在优化条件下可得到该问题调度长度上的最优解。
2
The results are three if and only if conditions under which an optimalschedule is of interval perturbation robustness.
本文的结果是该问题在加工时间扰动下最优调度具有区间摄动鲁棒性的三个充分必要条件。
3
At the same time, through the analysis of the parallel relation among the multiprocessor parallel job, the low bound of the optimalschedule has been provided.