文件名称:gzfp
介绍说明－－下载内容均来自于网络，请自行研究使用
假设有n个任务由k个可并行工作的机器完成。完成任务i需要时间为Ti。试设计一个算法找出完成这n个任务的最佳调度，使得完成全部任务的时间最早。
-Suppose there are n-task by the k-parallel machine can be completed. I need time to complete the task Ti. Try to design an algorithm to find completing these n-best task scheduling, making the earliest time to complete all tasks.
-Suppose there are n-task by the k-parallel machine can be completed. I need time to complete the task Ti. Try to design an algorithm to find completing these n-best task scheduling, making the earliest time to complete all tasks.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
5_13.cpp
5_13input.txt
5_13input.txt