资 源 简 介
在一台机器上只能处理n个作业，每个作业均可在单位时间内完成，又假定每个作业都有一个截止期限，当且仅当作业i在它的截止期限之前完成时，可以获得一定的效益。
给定作业序列，要求一种作业排序算法，使获得的总效益值最大。
-On a single machine can handle only n-jobs, each job can be completed within the unit, but also assumes that each job has a deadline, if and only if job i in its completed before the deadline, they can to receive some benefits.
For a given job sequence, requires a job sorting algorithm, so that the greatest value of total benefits received.
