Given a set of jobs where each job has a defined deadline and some profit associated with it. The profit of that job is given only when that job is completed within its deadline.The problem is to find the set of jobs which can be completed within the given deadlines maximizing the total profit.
Constraints-
1.Only one processor is available for processing all jobs.
2.Processor takes one unit of time to complete a job.
3.All the jobs have to be completed within their respective deadlines to obtain the profits
associated with them.
Get the detailed explanation on Job Sequencing with Deadlines with examples.
