搜索资源列表
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
(模拟退火法-韩甘特图)ypap107-parallel-machine-scheduling
- (模拟退火法-韩甘特图)ypap107-parallel-machine-scheduling,模拟退火算法求解并行车间调度问题程序,可运行出结果,结果可行有效(matlab编程实现)