| 基于双层蚂蚁算法的半导体炉管制程批调度研究 |
| |
| 引用本文： | 梁静,钱省三,马良.基于双层蚂蚁算法的半导体炉管制程批调度研究[J].系统工程理论与实践,2005,25(12):96-101. |
| |
| 作者姓名： | 梁静 钱省三 马良 |
| |
| 作者单位： | 上海理工大学管理学院,上海,200093 |
| |
| 基金项目： | 国家自然科学基金(70471065)，上海市教委第四期重点学科建设资助项目，上海市重点学科建设项目资助(T0502) |
| |
| 摘 要： | 借助蚁群系统较强的路径寻优能力与并行搜索特点,设计了一种双层蚂蚁算法,解决了多品种晶圆批连续到达动态环境下非等效平行多机器的批调度问题.仿真实验表明,算法能得到较好的可行解,并优于其他启发式算法,对高负载的工作环境具有良好的适用性.
|
| 关 键 词： | 批调度 炉管 蚂蚁算法 总完工时间 |
| 文章编号： | 1000-6788(2005)12-0096-06 |
| 修稿时间： | 2004年11月10 |
Two-level Ant Algorithm for the Furnace Batch Scheduling in Semiconductor Furnace Operation |
| |
| LIANG Jing,QIAN Sheng-san,MA Liang.Two-level Ant Algorithm for the Furnace Batch Scheduling in Semiconductor Furnace Operation[J].Systems Engineering —Theory & Practice,2005,25(12):96-101. |
| |
| Authors: | LIANG Jing QIAN Sheng-san MA Liang |
| |
| Abstract: | The problem of batch scheduling that arises in the furnace stage of semiconductor manufacturing is a new kind of optimization problem that minimizes make-spans on multi-server batch operations with dynamic multi-job arrivals.Based on the strong capability of searching for optimum and the characteristics of parallelism of ant system,this paper proposes a two-level ant algorithm to solve the batch-scheduling problem.Series of simulation experiments show that the results of the algorithm are better than that of some other heuristics and that it has good adaptability to the high work-load environment. |
| |
| Keywords: | batch scheduling furnace ant algorithm make-span |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《系统工程理论与实践》浏览原始摘要信息 |
| 点击此处可从《系统工程理论与实践》下载免费的PDF全文 |
