Description: 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.
- [Job-Scheduling] - First, the purpose of high-level languag
- [thinking_in_java-4th-cn] - learning java from the beginning!
- [jobs] - Assumed that only one machine n-deal ope
- [fen] - Try to design a greedy algorithm, can be
- [GS] - The realization of the grid containing t
File list (Check if you may need any files):
Download