Algorithmic approaches to setup minimization

Construction of classes of ordered sets are given for which the setup minimization problem can be solved by an efficient algorithm. Those constructions generalize series-parallel connections. Special classes of ordered sets are exhibited for which the greedy algorithm yields an optimal linear extension. In particular, it is shown that the class of N-free ordered sets is both defect optimal and strongly greedy.