Find minimum time to finish all jobs with given constraints - GeeksforGeeks

Find minimum time to finish all jobs with given constraints - GeeksforGeeks

Find minimum time to finish all jobs with given constraints

Given an array of jobs with different time requirements. There are K identical assignees available and we are also given how much time an assignee takes to do one unit of job. Find the minimum time to finish all jobs with following constraints.

• An assignee can be assigned only contiguous jobs. For example, an assignee cannot be assigned jobs 1 and 3, but not 2.
• Two assignees cannot share (or co-assigned) a job, i.e., a job cannot be partially assigned to one assignee and partially to other.

Read full article from Find minimum time to finish all jobs with given constraints - GeeksforGeeks