When the total weighted completion time criterion is concerned, a useful property is proved and then a dynamic programming algorithm is developed to solve this problem optimally. 当目标函数是最小化加权完成时间之和时，首先证明了最优调度的一个性质，并据此提出了动态规划算法。
A new global or near global optimization method,called self-adaptive evolutio nary programming is proposed in this paper. 从随机优化技术及生物进化机制角度出发，设计出一种新颖的自适应进化规划算法。
