点击次数：

发表时间：2011-01-01

发表刊物：大连理工大学学报

期号：2

页面范围：205-209

ISSN号：1000-8608

摘要：The complete job shop scheduling problem (CJSSP) considers machining and assembly constraints simultaneously and becomes tight-constraint problem. The existing genetic algorithms developed for JSSP can not maintain chromosome's feasibility of this tight-constrained problem. The basic CJSSP is described. Two key concepts, constituent type and operable gene string, are defined and then applied to building crossover and mutation operation in the feasible domain. The genetic algorithm is tested in both practical instances and problems adapted from JSSP benchmarks. The computation result is compared with that of some heuristics and it is demonstrated that the proposed algorithm is both feasible and efficient.

备注：新增回溯数据