A greedy reduction algorithm for setup optimization

Share/Save/Bookmark

Faigle, Ulrich and Schrader, Rainer (1992) A greedy reduction algorithm for setup optimization. Discrete Applied Mathematics, 35 (1). pp. 73-79. ISSN 0166-218X

open access
[img]
Preview
PDF
546kB
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.
Item Type:Article
Copyright:© 1992 Elsevier Science
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/30112
Official URL:http://dx.doi.org/10.1016/0166-218X(92)90297-N
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page

Metis ID: 140751