| EFFICIENT MULTI-OBJECTIVE EVOLUTIONARY ALGORITHM FOR JOB SHOP SCHEDULING＊ |
| |
| 引用本文： | Lei Deming Wu Zhiming Institute of Automation,Shanghai Jiaotong University,Shanghai 200030,China. EFFICIENT MULTI-OBJECTIVE EVOLUTIONARY ALGORITHM FOR JOB SHOP SCHEDULING＊[J]. 机械工程学报(英文版), 2005, 18(4): 494-497 |
| |
| 作者姓名： | Lei Deming Wu Zhiming Institute of Automation Shanghai Jiaotong University Shanghai 200030 China |
| |
| 作者单位： | Lei Deming Wu Zhiming Institute of Automation，Shanghai Jiaotong University，Shanghai 200030，China |
| |
| 基金项目： | This project is supported by National Natural Science Foundation of China(No.60574049, No.70071017). |
| |
| 摘 要： | A new representation method is first presented based on priority rules.According to this method,each entry in the chromosome indicates that in the procedure of the Giffler and Thompson (GT) algorithm,the conflict occurring in the corresponding machine is resolved by the corresponding priority rule.Then crowding-measure multi-objective evolutionary algorithm (CMOEA) is designed, in which both archive maintenance and fitness assignment use crowding measure.Finally the comparisons between CMOEA and SPEA in solving 15 scheduling problems demonstrate that CMOEA is suitable to job shop scheduling.
|
| 关 键 词： | 加工车间 多目标进化算法 生产调度 机械工厂 |
EFFICIENT MULTI-OBJECTIVE EVOLUTIONARY ALGORITHM FOR JOB SHOP SCHEDULING |
| |
| Lei Deming Wu Zhiming. EFFICIENT MULTI-OBJECTIVE EVOLUTIONARY ALGORITHM FOR JOB SHOP SCHEDULING[J]. Chinese Journal of Mechanical Engineering, 2005, 18(4): 494-497 |
| |
| Authors: | Lei Deming Wu Zhiming |
| |
| Affiliation: | Institute ot Automation,Shanghai Jiaotong University, Shanghai 200030, China |
| |
| Abstract: | A new representation method is first presented based on priority rules.According to this method,each entry in the chromosome indicates that in the procedure of the Giffler and Thompson (GT) algorithm,the conflict occurring in the corresponding machine is resolved by the corresponding priority rule.Then crowding-measure multi-objective evolutionary algorithm (CMOEA) is designed, in which both archive maintenance and fitness assignment use crowding measure.Finally the comparisons between CMOEA and SPEA in solving 15 scheduling problems demonstrate that CMOEA is suitable to job shop scheduling. |
| |
| Keywords: | Job shop Crowding measure Archive maintenance Fitness assignment Multi-objective evolutionary algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
