An economical variant of the dynamic programming method for an extremal bottleneck routing problem with internal tasks constrained by precedence conditions is considered. The algorithm for constructing the optimal solution based on this method is implemented for a personal computer.