首页 | 官方网站   微博 | 高级检索  
     

组合优化调度问题求解方法
引用本文:张居阳,孙吉贵.组合优化调度问题求解方法[J].计算机科学,2003,30(2):9-16.
作者姓名:张居阳  孙吉贵
作者单位:吉林大学计算机科学与技术学院 长春 130012
基金项目:国家自然科学基金,教育部骨干教师基金,吉林省自然科学基金
摘    要:1.引言优化是指一个从一组解中选取出最优解或最适应解的过程。优化方法涉及的工程领域很广,问题种类与性质繁多。归纳而言,最优化问题可分为函数优化问题和组合优化问题。其中函数优化的对象是一定区间内的连续变量,而组合优化的对象则是解空间中的离散状态。函数优化问题通常可描述为:令S为R~n上的有界子集(即变量的定义域),f:S→R为n维

关 键 词:组合优化  调度问题  最优化问题  函数优化

The Approach to Solving Combinatorial Optimization Schedule Problems
ZHANG JU-Yang SUN Ji-Gui.The Approach to Solving Combinatorial Optimization Schedule Problems[J].Computer Science,2003,30(2):9-16.
Authors:ZHANG JU-Yang SUN Ji-Gui
Abstract:Optimization schedule problem is this kind of problem that people often meet in the field of industrial manufacture, transportation and traffic. A good schedule scheme can improve the efficiency of production and reduce the cost of production. So scholars in all of the related fields have high regard for schedule problem at all times. This paper describes the method and technology about combinatorial optimization schedule problems. The research state and advances in this field are reviewed and surveyed. At the end of the paper an approach to solving Job Shop problem, a representative paradigm in schedule problem,is introduced and discussed concretely.
Keywords:Optimization  Schedule  Job-shop  Tabu search
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机科学》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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

京公网安备 11010802026262号