Minimizing Completion Time for a Class of Scheduling Problems

Abstract We consider a class of weighted linear scheduling problems with respect to precedence constraints and show by a short proof that the greedy algorithm performs optimally whenever the precedence constraints are N-free. The setup minimization problem for N-free ordered sets is a special case. Thus our approach generalizes and simplifies, e.g., the results of Rival (1983).