文件名称:femprb
介绍说明－－下载内容均来自于网络，请自行研究使用
Optimal scheduling problem, assuming that n has a mission by the k-parallel machine to complete the work. I need to complete the mission time for ti. Try to design an algorithm to find n complete this task the best scheduling, making the time to complete a full first mission.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
femprb