A greedy reduction algorithm for setup optimization

A greedy reduction algorithm for setup optimization

0.00 Avg rating0 Votes
Article ID: iaor19921397
Country: Netherlands
Volume: 35
Issue: 1
Start Page Number: 73
End Page Number: 79
Publication Date: Jan 1992
Journal: Discrete Applied Mathematics
Authors: ,
Abstract:

A reduction algorithm for setup optimization in general ordered sets is proposed. Moreover, the class of weekly 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 in the class of bipartite orders.

Reviews

Required fields are marked *. Your email address will not be published.