Algorithms and computational thinking

Each job takes one time slot, has a deadline, and earns its profit only if completed by its deadline. Which greedy strategy is used to maximize total profit when jobs can be scheduled in any order?