2002 | OriginalPaper | Chapter
Batch Processing with Sequence Dependent Setup Times
Author : Petr Vilím
Published in: Principles and Practice of Constraint Programming - CP 2002
Publisher: Springer Berlin Heidelberg
Included in: Professional Book Archive
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. 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.