作者：唐茂, 聂志萍, 李俭

作者单位：成都大学机械系, 四川成都 610106

关键词：作业车间调度问题; 组合优化; 混合优化; 关键路

摘要：

本文根据作业车间调度问题的数学模型和特点,首先改进了经典的TS和SA算法,在此基础上提出了一套基于关键路理论的混合优化算法,实现了关键路理论和混合优化策略的有机结合;应用此算法对该调度问题的一些实例进行了计算验证,实践证明本算法能显著提高优化效果和效率。该套方法对实现自动化、智能化的车间调度系统提供了较好的算法支持。

Research on optimum algorithm in intelligent shop scheduling system

TANG Mao, NEI Zhi-ping, LIN Jin

Department of Mechanism, Chengdu University, Chengdu 610106, China

Abstract: According to the individual features of JSSP, the traditional TS and SA algorithm has been modified and a set of optimum algorithms based on critical path has been presented.It realized the integration of critical path theory and tactics of Combinatorial Optimization.In many calculations of instances of JSSP, the results showed that this algorithm can solve the problem efficiently.This method can provide a strong support for realizing of automatic and intelligent scheduling system.

Keywords: Job-shop scheduling problem; Hybrid optimization; Combinatorial optimization; Critical path

2005, 31(4): 54-56  收稿日期: 2004-10-22;收到修改稿日期: 2005-1-5

基金项目: 

作者简介: 

参考文献

[1] 玄光男(日), 程润伟.遗传算法与工程设计[J].北京:科学出版社, 2000.
[2] 邢文训.Jobshop排序问题的模拟退火算法[C].中国运筹学会第二届全国排序学术会议论文集(武汉).
[3] R Knosala, T Wal.A production scheduling problem using genetic algorithm.Journal of Materials Processing Technology, 2001.
[4] 张居阳, 孙吉贵.组合优化调度问题求解方法[J].计算机科学, 2003, 30(2).