Description: 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.
To Search:
- [task_compositor] - period with the operations scheduling pr
- [diaodu] - Two processors A and B deal with n-opera
- [paixu] - Work sorting algorithm with a time limit
- [tongxunlu] - Address Book- C++ implementation
- [data_structor_show] - show datastructor
- [Program] - Test one: Enter a positive integer preci
File list (Check if you may need any files):
期限作业\期限作业.cpp
........\期限作业.exe
期限作业
Download