The document discusses the job sequencing problem where there are a set of jobs, each with a deadline and profit. The goal is to find an optimal solution that earns the maximum total profit by completing jobs by their deadlines. An optimal solution is to sequentially select the next job that increases the total profit the most, while ensuring the jobs are completed by their deadlines to produce a feasible solution.

1. Job Sequencing Problem

2. We are given a set of n jobs
Associated with job i is an integer deadline di >0 and a profit pi >0.
For any job i the profit pi is earned iff the job is completed by its
deadline.
An optimal solution is a feasible solution with maximum value.

4. We can choose the objective function sum of p as our
optimization measure.
Using this measure,the next job to include is the one that
increases P the most,subject to the constraint that the
resulting J is a feasible solution