文件名称:jiqisheji
- 所属分类:
- 数据结构常用算法
- 资源属性:
- [Windows] [Visual C] [源码]
- 上传时间:
- 2012-11-26
- 文件大小:
- 173kb
- 下载次数:
- 0次
- 提 供 者:
- m*
- 相关连接:
- 无
- 下载说明:
- 别用迅雷下载,失败请重下,重下不扣分!
介绍说明--下载内容均来自于网络,请自行研究使用
假定只能在一台机器上处理n个作业 ,每个作业 有一个处理时间 ,利润 和截止时间 。机器一次只能处理一个作业,作业 必须不间断地运行 个连续时间单位。如果作业 在它的截止时间 之前完成,则得利润 ,但如果作业在截止时间之后完成,则得利润为0。假设所有处理时间为 之间的整数,最大利润作业调度问题要求确定个n作业的一个子集,使得该子集中作业调度所获得的利润最大。-Assumed that only one machine n-deal operations, each operation has a processing time, profits and cut-off time. Machines can only handle one operation, operation must be run uninterrupted consecutive time units. If operating in its cut-off time to complete, then a profit, but if the operation was completed after the cut-off time, then a profit is 0. Assume that all processing time is between the integers, the greatest profit job scheduling problems require the identification of a n a subset of operations, making the sub-centralized job scheduling the biggest profits.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
jiqisheji
.........\Debug
.........\jiqisheji.c
.........\jiqisheji.dsp
.........\jiqisheji.dsw
.........\jiqisheji.ncb
.........\jiqisheji.opt
.........\jiqisheji.plg
.........\Debug
.........\jiqisheji.c
.........\jiqisheji.dsp
.........\jiqisheji.dsw
.........\jiqisheji.ncb
.........\jiqisheji.opt
.........\jiqisheji.plg