We discuss the dynamic programming approach to finding an optimal sequence of a set of tasks when the tasks are related by precedence restrictions. We describe how to use this approach in problems ...