This document discusses the job sequencing problem, where the goal is to schedule jobs to be completed by their deadlines to maximize total profit. It provides an example problem with 4 jobs, their profits, deadlines, and the optimal solution of scheduling jobs J1 and J2 to earn a total profit of 140.

1. Topic: Job Sequencing with Deadline
1 out of 6

2. The Job sequencing problem states as follows:
• There are ‘n’ jobs are given with their profits and deadlines.
• Profit is earned if and only if a job is done or complete within its
deadlines.
• It is supposed that each job needs one unit of time to complete the
job.
• Aims to find out the set of jobs that provides maximum profit.
2 out of 6

3. Algorithm
3 out of 6

4. Algorithm
4 out of 6

5. Example:(Max 2 slot)
Jobs J1 J2 J3 J4
Profit 100 40 20 3
Deadline 2 1 2 1
Job Slot Solution Profit Status
J1 [1,2] {J1} 100 Can do
J2 [0,1] [1,2] {j2 , J1} 100+40 Can do
J3 [0,1] [1,2] {j2 , J1} 140 Can not do
J4 [0,1] [1,2] {j2 , J1} 140 Can not do
Total profit: 140
0 1 2
j2 j1
5 out of 6

6. 6 out of 6