点击次数：

论文类型：期刊论文

发表时间：2011-01-01

发表刊物：INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING-THEORY APPLICATIONS AND PRACTICE

收录刊物：Scopus、SCIE

卷号：18

期号：7

页面范围：377-385

ISSN号：1943-670X

关键字：Assembly Job Shop; Repair operator; Genetic algorithm; Assembly constraints; Population diversity

摘要：Assembly Job-shop Scheduling Problem (AJSP) starts with JSP and then appends an assembly stage for final product. Assembly constraints decouple is the core technique in genetic algorithms for AJSP. However, repair operators for precedent-infeasible chromosomes in AJSP are less investigated in previous literatures. DSM is used to decouple the assembly constraints by Yassine et al. (2007), but it results in more diversity loss of populations. A new repair operator (EOBOAFT) is proposed to avoid too much diversity loss after repairing the infeasible chromosomes. Chromosomes map analysis and GA experiments are performed. Results suggest that EOBOAFT always outperforms DSM. An industrial application is given to validate the rationality of this algorithm at last.