OS Lab, Operating System Lab Manual
-
Updated
Apr 10, 2018 - C++
OS Lab, Operating System Lab Manual
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.
Add a description, image, and links to the job-scheduling-algorithm topic page so that developers can more easily learn about it.
To associate your repository with the job-scheduling-algorithm topic, visit your repo's landing page and select "manage topics."