The construction of discrete dynamic programming algorithms
by M. Held, R. M. Karp
Certain sequencing and scheduling problems are formulated as shortest-route problems and treated in a uniform manner by dynamic programming. Computational considerations are discussed.