GitHub - SimonIyamu/Weighted-Job-Scheduling: 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 Public

Notifications You must be signed in to change notification settings
Fork 0
Star 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.