Batch Processing with Sequence Dependent Setup Times

Authors:
Petr Vilím
Affiliations:
-
Venue:
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Year:
2002

Citing 1
Cited 3

Batch Processing with Sequence Dependent Setup Times

CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming

Batch Processing with Sequence Dependent Setup Times

CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Extension of O(n log n) Filtering Algorithms for the Unary Resource Constraint to Optional Activities

Constraints
Models for Global Constraint Applications

Constraints

Quantified Score

Hi-index	0.00

Visualization

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