Algorithms to Live By: The Computer Science of Human Decisions

by Brian Christian

In scheduling theory, as we saw in chapter 5, a greedy algorithm—for instance, always doing the shortest job available, without looking or planning beyond—can sometimes be all that a problem requires.