摘要
在研究双资源、多工艺路线作业车间调度的基础上,从实际作业车间调度系统存在大量不确定因素的情况出发,建立了模糊调度的数学模型。以最小完工时间和平均满意度最大为优化目标,基于遗传算法,对算法中初始种群的构造、适应度计算、遗传操作等方面进行了研究;应用改进的遗传算法,求解最优调度工序。最后给出了实例仿真和结论。
On the basis of the study of job shop scheduling with dual-resource and multi-process routes and in consideration of mass incertitude factors existing in actual job shop scheduling systems, the paper stes up a mathematical model for fuzzy scheduling. With the objective being the optimization of minimum time for process completion and maximum satisfaction on average, based on genetic algorithm, it studies the constructions of initial species, fitness computation and genetic operation etc. An improved genetic algorithm is applied to seeking the optimal scheduling of processes. A computation instance shows that the algorithm is feasible and efficient.
出处
《机械科学与技术》
CSCD
北大核心
2006年第12期1424-1427,1490,共5页
Mechanical Science and Technology for Aerospace Engineering
基金
国家自然科学基金项目(59990470)资助
关键词
作业调度
遗传算法
模糊调度
job shop scheduling
genetic algorithm
fuzzy scheduling
