In this chapter we will see greedy algorithm examples. In this tutorial we will learn about Job Sequencing Problem with Deadline. This problem consists of n jobs each associated with a deadline and profit and our objective is to earn maximum profit.
We will earn profit only when job is completed on or before deadline. We assume that each job will take unit time to complete.