调度问题中两类分离约束传播算法的比较及一种改进算法

A Comparison of Two Constraint Propagation Algorithms and an Improved Algorithm for Disjunctive Scheduling Problem

约束传播算法是求解约束满足问题的一种重要方法。调度问题是一种特殊的约束满足问题。本文介绍了调度问题中的Edge Finding和Energy Reasoning两种分离约束传播算法,并对它们进行了比较,文中最后给出了一种结合Energy Reasoning的Edge Finding改进算法。

Constraint propagation is a method for solving constraint satisfaction problem (CSP). Scheduling problem can be modeled 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.