最大利润作业调度问题.假定只能在一台机器是处理n个作业a1,a2,...,an,每个作业有一个处理时间tj,利润pj和截止期dj.机器一次只能处理一个作业,作业aj必须不间断地运行tj个连续时间单位.如果作业aj在它的截止期dj之前完成,则得利润pj,但如果作业在截止期只后完成,则得利润为0.假设所有处理时间为1..n之间的整数.最大利润作业调度问题要求确定n个作业的一个子集,使得该子集中作业调度所获得的利润最大.

-Maximum profit scheduling problem. Assumes that a machine can only deal with n-operation a1, a2 ,..., an, each job has a processing time tj, profit pj and deadline dj. Machine can only handle one operations, operations must be continuously run tj aj consecutive time units. If the job aj dj it completed before the deadline, then get profits pj, but only if the work completed at the deadline, you may return to 0. assumption that all processing time is an integer between 1 .. n. maximum profit scheduling problem requires to determine n-a subset of operations, makes the child focus on scheduling the biggest profits.