- Category:
- MiddleWare
- Tags:
-
- File Size:
- 1kb
- Update:
- 2013-01-23
- Downloads:
- 0 Times
- Uploaded by:
- hoticebeg
Description: Suppose there are n tasks done by the k-th machine can work in parallel, needed to complete the task i time Ti, try to design an algorithm to find the complete optimal scheduling of the n tasks, the task time of the completion of the formula earliest
To Search:
File list (Check if you may need any files):
2(2) - 副本
2(1) - 副本
2(1)
Download