看板
[ ACMCLUB ]
討論串[問題] 印刷機和裝訂機
共 5 篇文章
內容預覽:
Here is another solution:. For book printing:. 1. process the books with pi <= bi in order of nondecreasing order pi. 2. process the remaining books i
(還有178個字)
內容預覽:
I admit my original note is not right: it should be. Insert the new task in the middle is not better than put it in the back.. (not in the front as I
(還有479個字)
內容預覽:
<Reformulate the problem>. Given any optimal schedule, if the optimal time it gives is. T = \sum_i(bi)+t,. we can always pushing all the binding jobs
(還有989個字)