Description: 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.
To Search:
- [problem_one] - Maximum profit scheduling problem. Assum
File list (Check if you may need any files):
scheduling with limited\程序及结果.doc
.......................\说明.txt
scheduling with limited
Download