Objective: for a job scheduling problem where not all the jobs can be completed, this program will select the jobs with the most revenue to be completed. we can only do one job for each month. so for the first example, we do the job with 50 million revenue in the first month, do the job with 70 million revenue for the second month, and the job with 30 million revenue for the third month.
-
Notifications
You must be signed in to change notification settings - Fork 0
s-peiran/library
Folders and files
Name | Name | Last commit message | Last commit date | |
---|---|---|---|---|
Repository files navigation
About
No description, website, or topics provided.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published