You have a list of jobs.
Each job has a deadline and an associated profit if completed before the deadline.
Also, each job takes 1 unit of time to complete, and only one job can be completed at any given time (ie single thread)
You are required to choose which jobs to complete such that profits are maximised.
This isn't for homework, just my own interest really. I want to find any resources on this problem or algorithms to solve it. It is similar to the interval scheduling problem, but not quite the same.
Any help would be appreciated.