| 利用深度优先搜索方法求解作业排序 |
| |
| 引用本文： | 张选平,杭省策.利用深度优先搜索方法求解作业排序[J].系统工程与电子技术,1998(8). |
| |
| 作者姓名： | 张选平 杭省策 |
| |
| 作者单位： | 西安交通大学 |
| |
| 摘 要： | 作业排序通常是在一定的限制条件和优化目标的约束下，对有限的资源进行分配。采用搜索方法求解这类问题常会遇到冲突的状态结点，引起多次回溯。同时，由于问题状态空间庞大，搜索过程相当费时。本文通过研究作业排序问题状态空间的特点，引入冲突指派集的概念，提出了基于冲突指派集的深度优先搜索方法，缩小了搜索范围，提高了搜索效率。
|
| 关 键 词： | 作业管理，搜索，目标识别，资源分配 |
A Depth First Search for Solving Job Scheduling Problem |
| |
| Zhang Xuanping and Hang Shengce Xi'an Jiaotong University.A Depth First Search for Solving Job Scheduling Problem[J].System Engineering and Electronics,1998(8). |
| |
| Authors: | Zhang Xuanping and Hang Shengce Xi'an Jiaotong University |
| |
| Institution: | Zhang Xuanping and Hang Shengce Xi'an Jiaotong University,710049 |
| |
| Abstract: | Searching for solving job scheduling problem lies on time consumed because of the large searching space and a lot of backtracking. In this article, a set of conflicting assignments is intruduced, and a new algorithm of depth first search for solving job scheduling problem based on the set is proposed. By the algorithm, the searching space is reduced and the searching is performed efficiently. |
| |
| Keywords: | Job scheduling Depth first search A set of conflicting assignments |
| 本文献已被 CNKI 等数据库收录！ |
