基于冲突指派集求解作业排序问题的深度优先搜索方法  

A DEPTH-FIRST SEARCH FOR SOLVING JOB SCHEDULING PROBLEM BASED ON CONFLICTING ASSIGNMENTS

作　　者：张选平[1] 李越[1] 徐青川[1] 

机构地区：[1]西安交通大学

出　　处：《陕西科技大学学报（自然科学版）》1997年第3期85-90,共6页Journal of Shaanxi University of Science & Technology

摘　　要：通过研究作业排序问题的特点，引入冲突指派集的概念，提出了基于冲突指派集的深度优先搜索方法，缩小了搜索范围，提高了搜索效率．The set of conflicting assignments is introduced, and a new algorithm of depth-first search for solving job scheduling problem based on the set of conflicting assignments in proposed. By the algorithm, the searching space is reduced and searching is performed efficiently.

关 键 词：作业排序 深度优先搜索 冲突指派集 

分 类 号：O229[理学—运筹学与控制论]