-
Notifications
You must be signed in to change notification settings - Fork 0
The problem of Weighted Job Scheduling considers a set of jobs. Each job has a start time, a finish time and a profit. The goal is to find a subset of jobs with the maximum profit such that no two jobs in the subset overlap. My solution uses Dynamic Programming.
SimonIyamu/Weighted-Job-Scheduling
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
About
The problem of Weighted Job Scheduling considers a set of jobs. Each job has a start time, a finish time and a profit. The goal is to find a subset of jobs with the maximum profit such that no two jobs in the subset overlap. My solution uses Dynamic Programming.
Topics
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published