文件名称:schedulinglimited
介绍说明－－下载内容均来自于网络，请自行研究使用
带有限期的作业排序：假定只能在一台计算机上处理n 个作业，每个作业均可在单位时间内完成；
又假定每个作业i都有一个截止期限di>0，当且仅当作业i在它的期限截止以前被完成时，方可获
得pj>0的效益。-Scheduling with deadline: assume that a computer can only deal with n-job, each job can be completed in the unit of time they assume that each job i has a deadline di> 0, if and only if i work before its deadline to be completed in order to be pj> 0 results.
又假定每个作业i都有一个截止期限di>0，当且仅当作业i在它的期限截止以前被完成时，方可获
得pj>0的效益。-Scheduling with deadline: assume that a computer can only deal with n-job, each job can be completed in the unit of time they assume that each job i has a deadline di> 0, if and only if i work before its deadline to be completed in order to be pj> 0 results.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
scheduling with limited\程序及结果.doc
.......................\说明.txt
scheduling with limited
.......................\说明.txt
scheduling with limited