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.

Name		Name	Last commit message	Last commit date
.gitignore		.gitignore
main.cpp		main.cpp

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.

job-scheduler job-scheduling job-scheduling-algorithm weighted

Activity

0 stars

0 watching

0 forks

Report repository