Have you tried taking the complement of the set achieved from the Earliest Deadline First Algorithm?
This greedy approach works by selecting the job with the earliest deadline, then checking to see if there are any conflicts with its scheduling (thus accepting the job if there are no conflicts and rejecting if there are not). So, the complement of this set should give you what you are looking for [and the wikipedia page shows how it is optimal].
See also: Interval Scheduling