| 摘要: |
| 针对一类典型的约束满足问题——Job-Shop调度问题，在深度优先搜索算法的基础上，给出了形式化的约束一致性实施、操作选择策略和开始时间选择策略以及启发式的约束一致性实施和不完全回跳策略，从而提高了求解Job-Shop调度问题的效率. |
| 关键词: 一致性实施，操作选择，开始时间选择，不完全回跳，困难操作集. |
| DOI： |
| 分类号: |
| 基金项目:本文研究得到国家自然科学基金和中国科学技术大学青年基金资助. |
|
| On Solving Constraint Satisfaction Based Job-Shop Scheduling Problems |
|
CHEN En-hong,XUE Han-hong
|
| Abstract: |
| In this paper, the authors discuss how to solve a set of typical constraint satisfaction problems, Job-Shop scheduling problems. Based upon the depth-first search, formal strategies of enforcing consistency, selecting operation and selecting start time are given, heuristic strategies of enforcing consistency and incomplete back jumping are introduced to further enhance the efficiency in solving Job-Shop scheduling problems. |
| Key words: Enforcing consistency, selecting operation, selecting start time, incomplete back jumping, difficult operation set. |
