The author develops an iterative method for determining permutational job-servicing schedules in network systems and typical network fragments. On the basis of the two-stage procedure proposed earlier, he proposes iterative algorithms for determining schedules in deterministic systems, using a stopping parameter in the form of a lower bound on the quality function. The complexity of the algorithms is characterized.