摘要：The article describes a variant of GFA problem connected with shared storage. It shows that this GFA problem may be reduced to a well known problem of scheduling theory (the Bellmann-Johnson problem for two-machine conveyer system). It proposes an effective algorithm to solve a particular case of the problem.
