For the make-span minimization problem on two machines with periodic maintenance, it was shown that FFD algorithm was an efficient algorithm.
英
美
-
對于周期維護最小化時(shí)間表長(cháng)問(wèn)題,證明了經(jīng)典的FFD算法是一個(gè)很好的啟發(fā)式算法,并且得到了該算法的一個(gè)上界。
-
国内精品美女A∨在线播放xuan