Showing papers by "Rolf H. Möhring published in 1982"
TL;DR: In this paper, the authors considered the problem of minimizing a regular performance measure subject to resource constraints, and minimizing costs for resource requirements subject to a fixed completion time for arbitrary project networks with resource requirements.
Abstract: We consider the tasks (A) of minimizing a regular performance measure subject to resource constraints, and (B) of minimizing costs for resource requirements subject to a fixed completion time for arbitrary project networks with resource requirements. For these tasks we investigate those problems in which the optimum value is determined by the same partial order on the set of activities for all possible variations of the objective function (problems with a singular solution). It is shown that these problems constitute a large class of scheduling problems which can be recognized and solved in polynomial time. Furthermore, we give a complete characterization of all problems having a singular solution which is based on comparability graph recognition and forbidden substructures.
15 citations