A greedy reduction algorithm for setup optimization

U. Faigle, Rainer Schrader

Research output: Contribution to journalArticleAcademicpeer-review

56 Downloads (Pure)

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 languageEnglish
Pages (from-to)73-79
Number of pages7
JournalDiscrete applied mathematics
Volume35
Issue number1
DOIs
Publication statusPublished - 1992

Fingerprint Dive into the research topics of 'A greedy reduction algorithm for setup optimization'. Together they form a unique fingerprint.

  • Cite this