| 调度问题中两类分离约束传播算法的比较及一种改进算法 |
| |
| 引用本文： | 贺仁杰,谭跃进.调度问题中两类分离约束传播算法的比较及一种改进算法[J].运筹与管理,2004,13(2):25-29. |
| |
| 作者姓名： | 贺仁杰 谭跃进 |
| |
| 作者单位： | 国防科技大学,人文与管理学院系统工程研究所一室,湖南,长沙,410073 |
| |
| 摘 要： | 约束传播算法是求解约束满足问题的一种重要方法。调度问题是一种特殊的约束满足问题。本介绍了调度问题中的Edge-Finding和Energy-Reasoning两种分离约束传播算法，并对它们进行了比较，中最后给出了一种结合Energy-Reasoning的Edge-Finding改进算法。
|
| 关 键 词： | 调度问题 分离约束传播算法 约束传播 Edge-Finding Energy-Reasoning 约束满足 运筹学 人工智能 |
| 文章编号： | 1007-3221(2004)02-0025-05 |
| 修稿时间： | 2002年11月18 |
A Comparison of Two Constraint Propagation Algorithms and an Improved Algorithm for Disjunctive Scheduling Problem |
| |
| HE Ren-jie,TAN Yue-jin.A Comparison of Two Constraint Propagation Algorithms and an Improved Algorithm for Disjunctive Scheduling Problem[J].Operations Research and Management Science,2004,13(2):25-29. |
| |
| Authors: | HE Ren-jie TAN Yue-jin |
| |
| Abstract: | 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. |
| |
| Keywords: | constraint propagation scheduling problem Edge-Finding Energy-Reasoning |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
