2002 | OriginalPaper | Buchkapitel
Batch Processing with Sequence Dependent Setup Times
verfasst von : Petr Vilím
Erschienen in: Principles and Practice of Constraint Programming - CP 2002
Verlag: Springer Berlin Heidelberg
Enthalten in: Professional Book Archive
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Batch processing with sequence dependent setup times is a new extension of the disjunctive scheduling (scheduling on a unary resource). There are several successful filtering algorithms for solving disjunctive scheduling problem in a constraint programming framework. I adapted two of these algorithms (namely edge-finding and not-first/not-last) for the new extended problem and developed other three algorithms (not-before/not-after, precedence-graph-based filtering, sequence composition). Each of these algorithms filters out a different type of inconsistent values so they can be used together to achieve the maximum filtering.