Showing papers by "Peter Brucker published in 1990"

TL;DR: In this paper, a solution of the problem is given based on a decomposition of the set of all schedules into local regions in which the optimization problem is convex and the criterion functions are related to network flow problems.