点击次数：

发布时间：2019-03-11

论文类型：期刊论文

发表时间：2009-09-21

发表刊物：Materials Science Forum

收录刊物：Scopus、CPCI-S、EI

卷号：626 627

页面范围：705-710

ISSN号：0878493115

关键字：Assembly Job-shop Scheduling Problem; Feasible solution space; Fix operator; Feasible Genetic algorithm

摘要：The classical job-shop scheduling problems (JSP) become assembly job-shop scheduling problems (AJSP) if assembly constraints are attached to them. The entire solution space size and the feasible one of AJSP are analyzed and obtained by utilizing combinational mathematics. It is proved that the feasible solution space takes extremely small portion of the entire one. To minimize the makespan of AJSP, genetic algorithm searching in feasible solution space (FGA) is proposed and designed, and the search range of FGA is limited to feasible solution space. Finally, benchmarks tests and results are given which demonstrate the advantage and efficiency of FGA. © (2009) Trans Tech Publications, Switzerland.