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 ...

A further constraint is that, to repeat, the shuttles must begin and end the sequence in the same boxes. This problem may be formulated simply in dynamic programming terms, but this leads to a ...