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. 從隨機優化技術及生物進化機制角度出發，設計出一種新穎的自適應進化規劃演算法。
