| 基于联姻遗传算法的混合FloWshop提前/拖期调度问题 |
| |
| 引用本文： | 路飞,田国会. 基于联姻遗传算法的混合FloWshop提前/拖期调度问题[J]. 计算机应用, 2004, 24(7): 122-124 |
| |
| 作者姓名： | 路飞 田国会 |
| |
| 作者单位： | 山东大学,控制科学与工程学院,山东,济南,250061;山东大学,控制科学与工程学院,山东,济南,250061 |
| |
| 基金项目： | 国家自然科学基金资助项目 (60 1 0 4 0 0 9) |
| |
| 摘 要： | 混合流水车间(Flowshop)提前／拖期调度问题的目标是4~_r-件的提前／拖期惩罚成本最小，这是一个NP完全问题，很难用一般的方法解决。文中首先给出了问题的数学模型，然后采用联姻遗传算法求解该问题。仿真结果表明此算法能有效地解决该类复杂调度问题。
|
| 关 键 词： | 混合Flowshop调度 提前/拖期 联姻遗传算法 |
| 文章编号： | 1001-9081(2004)07-0122-03 |
Solution to Earliness and Tardiness Hybrid Flowshop Scheduling Problem Using Allied Genetic Algorithm |
| |
| LU Fei,TIAN Guo hui. Solution to Earliness and Tardiness Hybrid Flowshop Scheduling Problem Using Allied Genetic Algorithm[J]. Journal of Computer Applications, 2004, 24(7): 122-124 |
| |
| Authors: | LU Fei TIAN Guo hui |
| |
| Abstract: | The objective of earliness and tardiness hybrid flowshop scheduling problem is to minimize the total earliness and tardiness cost. It is a NP complete problem and can hardly be solved with usual method. In this paper, a model of this problem is presented and the allied genetic algorithm is constructed to solve it. The simulation results show that this method is effective in solving complex scheduling problem. |
| |
| Keywords: | hybrid Flowshop scheduling earliness/tardiness allied genetic algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
