In Job Sequencing Deadline Problem, the
the objective is to find the sequence of jobs,
which is completed within their deadline
and gives maximum profit.
3. Problem Statement
In Job Sequencing Deadline Problem, the
objective is to find the sequence of jobs,
which is completed within their deadline
and gives maximum profit.
4. Solution
Let us consider a set of ‘n’ jobs which are
associated with deadlines.
We need to focus on three things here:
(a) The profit is earned if a job is completed.
(b) Jobs must be in an order.
(c) Maximum profit.
5. Constraints
Assume,
Then, the optimal solution of this
algorithm is a feasible solution with
maximum profit.
Deadline of ith job Ji = D(i)
Profit = Pi
11. Points to remember…
1. In ‘Job Sequencing With Deadline’ problem we have n jobs
J1, J2, … , Jn each has an associated deadline D1, D2, … , Dn
and profit P1, P2, ... , Pn.
2. Profit will only be awarded or earned if the job is
completed on or before the deadline.
3. We assume that each job takes unit time to complete.
4. The objective is to earn maximum profit when only one
job can be scheduled or processed at any given time.