he Job sequencing problem states as follows:

There are ‘n’ jobs to be processed on a machine

Each job ‘i’ has a deadline di ≥ 0 and profit pi ≥ 0.

Profit is earned if & only if the job is completed ...

Lesson 3

# Greedy Method Approach

#### Job Sequencing

**Answer:**... (more)

### Let n = 4, (p1 , p2, p3, p4) = (100, 10, 15, 27) and (dl, d2, d3, d4) = (2, 1, 2, 1). Find feasible solutions, using job sequencing with deadlines.

**Answer:**... (more)