sheduling

I don't understand instructions of given problem `scheduling` at `greedy algorithms`. Can you provide some extra reference for it or explain in detail what does it mean `find a schedule that includes as many events as possible` ? From given question i don't understand why not choosing every possible event.