The shifting bottleneck procedure for job shop scheduling
Management Science
Constraint-Based Scheduling
Constraint-Based Job Shop Scheduling with {\sc Ilog\ Scheduler}
Journal of Heuristics
Sweep as a Generic Pruning Technique Applied to the Non-overlapping Rectangles Constraint
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
A New Multi-resource cumulatives Constraint with Negative Heights
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
A fast and simple algorithm for bounds consistency of the all different constraint
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
A Position-Based Propagator for the Open-Shop Problem
CPAIOR '07 Proceedings of the 4th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Linear Weighted-Task-Sum --- Scheduling Prioritized Tasks on a Single Resource
Applications of Declarative Programming and Knowledge Management
| Hi-index | 0.00 |
Overload checking, forbidden regions, edge finding, and not-first/not-last detection are well-known propagation rules to prune the start times of activities which have to be processed without any interruption and overlapping on an exclusively available resource, i.e. machine. These rules are extendible by two other rules which take the number of activities into account which are at most executable after or before another activity. To our knowledge, these rules are based on approximations of the (minimal) earliest completion times and the (maximal) latest start times of sets of activities. In this paper, the precise definitions of these time values as well as an efficient procedure for their calculations are given. Based on the resulting time values the rules are re-formulated and applied to a well-known job shop scheduling benchmark.