Batch processing with sequence dependent setup times

Abstract

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/notlast)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.