- Category:
- .net
- Tags:
-
[Text]
- File Size:
- 1kb
- Update:
- 2012-11-26
- Downloads:
- 0 Times
- Uploaded by:
- shenmuye
Description: Optimal scheduling problem, assuming there are n a task by the k-parallel machine can be completed. The time required to complete the task i is ti. Try to design a complete algorithm to find the optimal scheduling of tasks n, make the time to complete all tasks first.
File list (Check if you may need any files):
Machine.txt