文件名称:task_compositor
介绍说明－－下载内容均来自于网络，请自行研究使用
带有期限的作业排序问题：假定只能在一台机器上处理n个作业，每个作业均可在单位时间内完成；又假定每个作业i都有一个截止期限di>0(它是整数)，当且仅当作业i在它的期限截止以前被完成时，则获得pi>0的效益。求具有最大效益值的可行解。
文件中包含详细的源代码和注释，以实现这个经典的问题。-period with the operations scheduling problem : the assumption that only a machine n handling operations, each of the operating units can be completed within time; Also assume that each job i have a deadline di
文件中包含详细的源代码和注释，以实现这个经典的问题。-period with the operations scheduling problem : the assumption that only a machine n handling operations, each of the operating units can be completed within time; Also assume that each job i have a deadline di
(系统自动生成,下载前可以参看下载内容)
下载文件列表
带有限期的作业排序.cpp