Abstract:
The paper is concerned with the Bellman — Johnson problem on a tree-like network (in the case of two machines). The view is refuted that no algorithm with exponential labor consumption estimate exists for it. An effective solution algorithm is proposed for a labor consumption of $O(n \log n)$ where $n$ is the number of activities.