点击次数：

论文类型：期刊论文

发表时间：2022-06-29

发表刊物：系统工程理论与实践

期号：9

页面范围：73-77

ISSN号：1000-6788

摘要：Assembly scheduling plays a great part in job shops with high-variety low-volume production. We will describe a multi-product complete job shop scheduling problem (CJSSP) with fabrication and assembly operations. The classic job shop scheduling benchmark FT10 was adapted to be our problem instance. A selective decoding string that embodies product structural information was designed to decode chromosome directly. Computation results indicate the feasibility and validity of the proposed approach. Moreover, the achieved assembly finish time is close to the lower limit under the assumption of finite capacity and better than the result of the CP dispatching rule.

备注：新增回溯数据