点击次数：

论文类型：期刊论文

发表时间：2011-06-15

发表刊物：INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH

收录刊物：EI、SCIE、Scopus

卷号：49

期号：12

页面范围：3585-3604

ISSN号：0020-7543

关键字：job-shop scheduling; genetic algorithm; decode select string decoding; assembling work

摘要：With job-shop scheduling (JSS) it is usually difficult to achieve the optimal solution with classical methods due to a high computational complexity (NP-hard). According to the nature of JSS, an improved definition of the JSS problem is presented and a JSS model based on a novel algorithm is established through the analysis of working procedure, working data, precedence constraints, processing performance index, JSS algorithm and so on. A decode select string (DSS) decoding genetic algorithm based on operation coding modes, which includes assembly problems, is proposed. The designed DSS decoding genetic algorithm (GA) can avoid the appearance of infeasible solutions through comparing current genes with DSS in the decoding procedure to obtain working procedure which can be decoded. Finally, the effectiveness and superiority of the proposed method is clarified compared to the classical JSS methods through the simulation experiments and the benchmark problem.