| Article ID: | iaor20053111 |
| Country: | China |
| Volume: | 13 |
| Issue: | 2 |
| Start Page Number: | 25 |
| End Page Number: | 29 |
| Publication Date: | Apr 2004 |
| Journal: | Operations Research and Management Science |
| Authors: | He Renjie, Tan Yuejin |
Constraint propagation is a method for solving constraint satisfaction problem (CSP). Scheduling problem can be modelled as a CSP. This paper introduces two constraint propagation algorithms for disjunctive scheduling problem, Edge-Finding and Energy-Reasoning, and compares their propagation ability with some examples. It also gives a hybrid algorithm of Edge-Finding and Energy-Reasoning.