Abstract
A reduction algorithm for setup optimization in general ordered sets is proposed. Moreover, the class of weakly cycle-free orders is introduced. All orders in this class are Dilworth optimal. Cycle-free orders and bipartite Dilworth optimal orders are proper subclasses. The algorithm allows greedy setup optimization in cycle-free orders and coincides with the algorithm of Syslo et al. [5] in the class of bipartite orders.
Original language | English |
---|---|
Pages (from-to) | 73-79 |
Number of pages | 7 |
Journal | Discrete applied mathematics |
Volume | 35 |
Issue number | 1 |
DOIs | |
Publication status | Published - 1992 |