| 用遗传算法求解一类不确定性作业车间调度问题 |
| |
| 引用本文： | 乔威,王冰,孙洁.用遗传算法求解一类不确定性作业车间调度问题[J].计算机集成制造系统,2007,13(12):2452-2455,2468. |
| |
| 作者姓名： | 乔威 王冰 孙洁 |
| |
| 作者单位： | [1]山东大学威海分校实验室与设备管理处,山东威海264209 [2]山东大学威海分校信息工程学院,山东威海264209 |
| |
| 基金项目： | 山东大学校科研和教改项目 |
| |
| 摘 要： | 对具有不确定加工时间和交货期窗口的一类作业车间调度问题进行了研究.不确定加工时间用区间数来表示,以工件提前或者拖期遭受惩罚的可能性的总加权和最小作为优化目标.设计了带精英交叉策略的遗传算法求解此类问题.仿真实验验证了该算法的有效性.计算结果表明,该遗传算法有更快的收敛速度、更高的优化精度和更好的初值鲁棒性.
|
| 关 键 词： | 不确定性 作业车间调度 区间数 遗传算法 遗传算法 求解 不确定性 作业 车间调度问题 genetic algorithm problems Job Shop scheduling 鲁棒性 初值 精度 优化目标 收敛速度 结果 计算 有效性 实验验证 仿真 交叉策略 设计 |
| 文章编号： | 1006-5911（2007）12-2452-04 |
| 收稿时间： | 2007-02-01 |
| 修稿时间： | 2007-06-06 |
Uncertain Job Shop scheduling problems solved by genetic algorithm |
| |
| QIAO Wei,WANG Bing,SUN Jie.Uncertain Job Shop scheduling problems solved by genetic algorithm[J].Computer Integrated Manufacturing Systems,2007,13(12):2452-2455,2468. |
| |
| Authors: | QIAO Wei WANG Bing SUN Jie |
| |
| Abstract: | Research was conducted on the Job Shop Scheduling Problems(JSSP) with uncertain processing time and due date windows.Uncertain processing time was represented by interval numbers.The objective was to minimize the weighted sum of penalty possibility for jobs due to earliness or tardiness.Genetic algorithm based on elitist-crossover strategy was proposed to solve the uncertain JSSP.Simulation experiments were carried on to prove the effectiveness of the algorithm.Computation results showed that the proposed genetic algorithm had better convergence speed,optimization accuracy and initial value robustness. |
| |
| Keywords: | uncertainty Job Shop scheduling interval number genetic algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
