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

半在线调度中约束求解算法研究
引用本文:张居阳, 孙吉贵, 杨轻云. 半在线调度中约束求解算法研究. 自动化学报, 2007, 33(7): 765-767. doi: 10.1360/aas-007-0765
作者姓名:张居阳  孙吉贵  杨轻云
作者单位:1.吉林大学计算机科学与技术学院 长春 130012;;2.符号计算与知识工程教育部重点实验室 长春 130012
基金项目:国家自然科学基金;教育部跨世纪优秀人才培养计划;吉林省杰出青年科学基金
摘    要:很多实际调度问题是半在线的. 尝试运用人工智能方法来求解半在线调度问题, 首先简要介绍了半在线调度问题并对其约束模型进行了分类, 通过引入单调性约束扩展的相关概念, 从约束建模角度形式化描述 了一类动态约束扩展, 并在此基础上设计了一个完备动态约束求解算法, 最后给出该算法在半在线离散资源约束调度求解的应用算例. 测试结果表明, 该算法是可行有效的.

关 键 词:半在线调度   约束求解   单调性
收稿时间:2005-10-12
修稿时间:2005-10-122006-08-23

A Constraint Solving Algorithm for Semi On-line Scheduling Problem
ZHANG Ju-Yang, SUN Ji-Gui, YANG Qing-Yun. A Constraint Solving Algorithm for Semi On-line Scheduling Problem. ACTA AUTOMATICA SINICA, 2007, 33(7): 765-767. doi: 10.1360/aas-007-0765
Authors:ZHANG Ju-Yang  SUN Ji-Gui  YANG Qing-Yun
Affiliation:1. College of Computer Science and Technology, Jilin University, Changchun 130012;;;2. Key Laboratry of Symbolic Computation and Knowledge Engineering of Ministry of Education, Changchun 130012
Abstract:Most of real-life scheduling problems are semi online. Recently, how to solve such dynamic problems is a hot topic in the research of artificial intelligence. The semi on-line scheduling is introduced and the constraint models are analyzed and categorized. By defining the relevant concept of monotony about constraints that appear in general dynamic constraint models, a kind of constraint extending is formalized. Based on this dynamic constraint modeling, a sound dynamic constraint solving algorithm is designed to deal with the scheduling problems. Finally, an application example of semi on-line discrete resource scheduling problems is given. Experiments show that the algorithm is valid.
Keywords:Semi on-line scheduling   constraint solving monotony
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《自动化学报》浏览原始摘要信息
点击此处可从《自动化学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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