| 一种求解JOB SHOP问题的新型混合遗传算法 |
| |
| 引用本文： | 姬彬,周泓,刘臣勇. 一种求解JOB SHOP问题的新型混合遗传算法[J]. 北京航空航天大学学报(社会科学版), 2001, 14(1): 39-42 |
| |
| 作者姓名： | 姬彬 周泓 刘臣勇 |
| |
| 作者单位： | 北京航空航天大学,经济管理学院,北京,100083 |
| |
| 基金项目： | 国家自然科学基金;79970054; |
| |
| 摘 要： | 针对一般车间（JOB SHOP）的作业排序问题设计了一种新的混合遗传算法,该算法将遗传算法和启发式方法相结合,利用遗传算法优化每台机器的首工序,并确定每台机器的优先工序,借助仿真,按照启发式方法安排每台机器的后续工序。通过算例比较,表明该算法具有良好的求解性能。
|
| 关 键 词： | 启发式 遗传算法 排序 |
| 文章编号： | 1008-2204(2001)01-0039-04 |
| 修稿时间： | 2000-07-06 |
A New Hybrid Genetic Algorithm for JOB SHOP Scheduling |
| |
| JI Bin,ZHOU Hong,LIU Chen-yong. A New Hybrid Genetic Algorithm for JOB SHOP Scheduling[J]. Journal of Beijing University of Aeronautics and Astronautics(Social Sciences Edition), 2001, 14(1): 39-42 |
| |
| Authors: | JI Bin ZHOU Hong LIU Chen-yong |
| |
| Abstract: | A new hybrid genetic algorithm is introduced for job shop scheduling problem, in which genetic algorithm is integrated with heuristic approach. The algorithm makes use of genetic algorithm to optimize the first operation and determine the prior operation of each machine. Succedent operations of each machine are arranged through heuristic rules inhabited in a simulator. Numerical experiments have been made finally which show the effectiveness and efficiency of the algorithm compared with other approaches. |
| |
| Keywords: | heuristics genetic algorithm schoduling |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
