| 求解具有恶化工件单机调度问题的改进遗传算法 |
| |
| 引用本文： | 郭鹏,程文明,张则强. 求解具有恶化工件单机调度问题的改进遗传算法[J]. 西南交通大学学报, 2011, 46(3): 506-511. DOI: 10.3969/j.issn.0258-2724.2011.03.025 |
| |
| 作者姓名： | 郭鹏 程文明 张则强 |
| |
| 作者单位： | 西南交通大学机械工程研究所,四川,成都,610031 |
| |
| 基金项目： | 高等学校博士学科点专项科研基金资助项目，中央高校基本科研业务费专项基金资助项目 |
| |
| 摘 要： | 为克服现有算法求解工件数较多的单机调度问题计算量大的缺点,分析了加工时间为阶梯函数的工件排序规则,以极小化最大完工时间为目标,提出了基于局部搜索的改进遗传算法,对基于工序编码方式的染色体设计了线性顺序交叉算子和融合工件排序性质的局部变异算子,并引入局部搜索策略,提高了算法局部搜索能力和收敛速度.算例测试结果表明:工件数为40件时,与模拟退火算法相比,本文算法求得的最大完工时间平均减少了56.6%,显著缩短了制造周期,并有效地避免了局部最优解,收敛速度显著提高.
|
| 关 键 词： | 单机调度 恶化工件 遗传算法 完工时间 |
Improved Genetic Algorithm for Single Machine Scheduling Problems with Deteriorating Jobs |
| |
| GUO Peng,CHENG Wenming,ZHANG Zeqiang. Improved Genetic Algorithm for Single Machine Scheduling Problems with Deteriorating Jobs[J]. Journal of Southwest Jiaotong University, 2011, 46(3): 506-511. DOI: 10.3969/j.issn.0258-2724.2011.03.025 |
| |
| Authors: | GUO Peng CHENG Wenming ZHANG Zeqiang |
| |
| Affiliation: | GUO Peng,CHENG Wenming,ZHANG Zeqiang(Research Institute of Mechanical Engineering,Southwest Jiaotong University,Chengdu 610031,China) |
| |
| Abstract: | To reduce the computational load of the existing algorithms for solving the large-size single machine scheduling problem,an analysis was made of the scheduling rule of the problem with stepwise deteriorating jobs,and an improved genetic algorithm(IGA) based on local search was proposed to minimize the makespan.In the IGA,a linear order crossover operator and a mutation operator based on the property of deteriorating jobs sequencing were designed for the chromosome using job-based encoding.Moreover,a local s... |
| |
| Keywords: | single machine scheduling deteriorating job genetic algorithm makespan |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
