Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4634926 | Applied Mathematics and Computation | 2008 | 16 Pages |
Abstract
Furthermore, the order in which constraints are studied can improve efficiency, particularly in problems with non-binary constraints. In this paper, we present a preprocess heuristic called constraint ordering heuristic (COH) that studies the constrainedness of the scheduling problem and mainly classifies the constraints so that the tightest ones are studied first. Thus, constrainedness can be known in advance and overall inconsistencies can be found earlier and the number of constraint checks can significantly be reduced.
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
Miguel A. Salido,