| Improved Genetic Algorithm for Job-Shop Scheduling |
| |
| 引用本文： | 程蓉 陈幼平 李志刚. Improved Genetic Algorithm for Job-Shop Scheduling[J]. 西南交通大学学报(英文版), 2006, 14(3): 223-227 |
| |
| 作者姓名： | 程蓉 陈幼平 李志刚 |
| |
| 作者单位： | [1]School of Materials Science ＆ Engineering, Huazhong University of Science and Technology, Wuhan 430070, China [2]College of Engineering and Technology, Shenzhen University, Shenzhen 518060, China |
| |
| 摘 要： | Introduction Job shopschedulingproblem(JSP)isoneofthe well knownhardestcombinatorialoptimizationprob lems,andmanysolutionsbasedongeneticalgorithms(GAs)havebeenproposedbymanyresearchersso far[13].SincethedemonstrationofapplicationofGA toschedulingproblemsb…
|
| 关 键 词： | 遗传算法 车间 调度 假说理论 |
| 文章编号： | 1005-2429（2006）03-0223-05 |
| 收稿时间： | 2005-06-08 |
Improved Genetic Algorithm for Job-Shop Scheduling |
| |
| Cheng Rong,Chen Youping,Li Zhigang. Improved Genetic Algorithm for Job-Shop Scheduling[J]. Journal of Southwest Jiaotong University, 2006, 14(3): 223-227 |
| |
| Authors: | Cheng Rong Chen Youping Li Zhigang |
| |
| Abstract: | This paper presents a new genetic algorithm for job-shop scheduling problem. Based on schema theorem and building block hypothesis, a new crossover is proposed. By selecting short, low-order, highly fit schemas for genetic operator, the crossover can maintain a diversity of population without disrupting the characteristics and search the global optimization. Simulation results on famous benchmark problems MT06, MT10 and MT20 coded by Matlab show that our genetic operators are suitable to job-shop scheduling problems and outperform the previous GA-based approaches. |
| |
| Keywords: | Job-shop scheduling Genetic algorithm Schema theorem Building block hypothesis |
| 本文献已被 维普 万方数据 等数据库收录！ |
