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)規劃算法。
The integer programming algorithm in this paper is proved very efficient natty examples. 列舉多個(gè)算例，對這些算例進(jìn)行比較表明，所提出的整數規劃算法非常有效。
