| 求解多目标单机分批排序问题 |
| |
| 引用本文： | 张召生,孔淑兰,马建华.求解多目标单机分批排序问题[J].山东大学学报(理学版),2004,39(2):50-55. |
| |
| 作者姓名： | 张召生 孔淑兰 马建华 |
| |
| 作者单位： | 1. 山东大学,数学与系统科学院,山东,济南,250100
2. 曲阜师范大学数学系,山东,曲阜,273165 |
| |
| 基金项目： | 国家自然科学基金资助项目 (10 2 710 65 ) |
| |
| 摘 要： | 分批排序(Batch Scheduling)是在半导体生产过程的最后阶段提炼出来的一类新型的排序问题．单机分批排序问题就是n个工件在一台机器上加工，要将工件分批，每批最多可以同时加工B个工件，每批的加工时间等于此批工件中的最大的加工时间．目前只有Cheng-shuo Wang，Reha Uzsoy运用Random Key方法编码研究了单目标函数为Lmax的分批排序问题．给出组合优化中的多目标分批排序问题的一种新编码，结合模糊数学知识，运用遗传算法研究多目标分批排序问题．研究了多目标遗传算法的机制特征，进而给出求解多目标分批排序的遗传算法．
|
| 关 键 词： | 排序 分批排序 遗传算法 多目标分批排序 |
| 文章编号： | 1671-9352(2004)02-0050-06 |
| 修稿时间： | 2003年6月16日 |
Using genetic algorithm for single machine solving multiple batch scheduling problem |
| |
| ZHANG Zhao-sheng ,KONG Shu-lan & MA Jian-hua.Using genetic algorithm for single machine solving multiple batch scheduling problem[J].Journal of Shandong University,2004,39(2):50-55. |
| |
| Authors: | ZHANG Zhao-sheng KONG Shu-lan & MA Jian-hua |
| |
| Affiliation: | ZHANG Zhao-sheng 1,KONG Shu-lan 2 & MA Jian-hua 1 |
| |
| Abstract: | The problem of minimizing multiple objections of batch scheduling was studied. It was arisen in the burn-in stage of semiconductor manufacturing. Burn-in ovens are modeled as batch-processing machines that can handle up to B jobs simultaneously. The processing time of a batch is equal to the longest processing time among the jobs in the batch. Only Cheng-shuo Wang and Reha Uzsoy researched the batch scheduling problem with objection L _ max by random key. The multiple batch scheduling problem was researched using genetic algorithm with fuzzy mathematics and a new code was proposed. |
| |
| Keywords: | scheduling batch scheduling genetic algorithm multiple batch scheduling |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
