Summary: This paper considers a set of dependent operations having an antitree graph network. Each operation has its own objective function being a time of its completion. A relative importance of the objectives depends on the position in the graph. The problem of optimal allocation of a finite discrete resource is formulated as a multi-objective discrete nonlinear programming problem. The proposed solution procedure is based on the iterative goal programming methodology. A numerical example of its application is presented.