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. 當目標函數是最小化加權完成時(shí)間之和時(shí)，首先證明了最優(yōu)調度的一個(gè)性質(zhì)，并據此提出了動(dòng)態(tài)規劃算法。
A new global or near global optimization method,called self-adaptive evolutio nary programming is proposed in this paper. 從隨機優(yōu)化技術(shù)及生物進(jìn)化機制角度出發(fā)，設計出一種新穎的自適應進(jìn)化規劃算法。
