| 用混合算法求解Flow shop调度问题 |
| |
| 引用本文： | 徐震浩 顾幸生. 用混合算法求解Flow shop调度问题[J]. 医学教育探索, 2004, 0(2): 234-238 |
| |
| 作者姓名： | 徐震浩 顾幸生 |
| |
| 作者单位： | 华东理工大学自动化研究所，华东理工大学自动化研究所 上海200237，上海200237 |
| |
| 基金项目： | 国家自然科学基金项目(60274043)，国家高技术研究发展计划项目(2002AA412610) |
| |
| 摘 要： | 研究了流程工业中的Flow shop调度问题，针对免疫算法的随机性和不确定性，结合分枝定界方法的特点，提出了一种基于免疫算法和分枝定界方法的混合调度算法，仿真结果表明该算法不仅能有效解决调度问题，而且提高了搜索效率。
|
| 关 键 词： | Flow shop 免疫算法 分枝定界 调度 |
A Hybrid Method for Scheduling Problems of Flow Shop |
| |
| XU Zhen-hao,GU Xing-sheng. A Hybrid Method for Scheduling Problems of Flow Shop[J]. Researches in Medical Education, 2004, 0(2): 234-238 |
| |
| Authors: | XU Zhen-hao GU Xing-sheng |
| |
| Affiliation: | XU Zhen-hao,GU Xing-sheng~ |
| |
| Abstract: | This paper is focusd on the study of scheduling problems of flow shop in the batch plant. Compared with the randomicity and uncertainty of immune algorithm, a hybrid method is proposed based on the feature of the branch and bound algorithm. Simulation results have shown not only the effectiveness of the algorithm, but also the high searching efficiency. |
| |
| Keywords: | Flow shop immune algorithm branch and bound scheduling |
|
| 点击此处可从《医学教育探索》浏览原始摘要信息 |
|
点击此处可从《医学教育探索》下载全文 |
