摘要
作业排序通常是在一定的限制条件和优化目标的约束下，对有限的资源进行分配。采用搜索方法求解这类问题常会遇到冲突的状态结点，引起多次回溯。同时，由于问题状态空间庞大，搜索过程相当费时。本文通过研究作业排序问题状态空间的特点，引入冲突指派集的概念，提出了基于冲突指派集的深度优先搜索方法，缩小了搜索范围，提高了搜索效率。
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.
出处
《系统工程与电子技术》
EI
CSCD
1998年第8期19-22,64,共5页
Systems Engineering and Electronics
关键词
作业管理
搜索
目标识别
资源分配
作业排序
Job scheduling, Depth first search, A set of conflicting assignments.
