Desktop

代码说明：

  假设有n个任务由k个可并行工作的机器来完成，完成任务i需要的时间为ti，试设计一个算法找出完成这n个任务的最佳调度，式的完成全部任务的时间最早(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)

文件列表：

2(1),783,2013-01-23
2(1) - 副本,783,2013-01-23
2(2) - 副本,783,2013-01-23