首页 | 本学科首页   官方微博 | 高级检索  
     

基于冲突指派集求解作业排序问题的深度优先搜索方法
引用本文:张选平,李越,徐青川. 基于冲突指派集求解作业排序问题的深度优先搜索方法[J]. 陕西科技大学学报, 1997, 0(3)
作者姓名:张选平  李越  徐青川
作者单位:西安交通大学
摘    要:通过研究作业排序问题的特点,引入冲突指派集的概念,提出了基于冲突指派集的深度优先搜索方法,缩小了搜索范围,提高了搜索效率.

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

A DEPTH-FIRST SEARCH FOR SOLVING JOB SCHEDULING PROBLEM BASED ON CONFLICTING ASSIGNMENTS
Zhang Xuanping Li Yue Xu Qingchuan. A DEPTH-FIRST SEARCH FOR SOLVING JOB SCHEDULING PROBLEM BASED ON CONFLICTING ASSIGNMENTS[J]. Journal of Shaanxi University of Science & Technology(Natural Science Edition), 1997, 0(3)
Authors:Zhang Xuanping Li Yue Xu Qingchuan
Affiliation:Zhang Xuanping Li Yue Xu Qingchuan
Abstract: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.
Keywords:job scheduling   depth-first search  conflicting assignments  
本文献已被 CNKI 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号