点击次数：

发表时间：2010-01-01

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

期号：4

页面范围：535-539

ISSN号：1000-8608

摘要：Scheduling for fabrication and assembly operations is researched independently. So far there are relatively less scheduling studies concerning job-shop assembly operation. To solve this problem, a job-shop scheduling problem (JSSP) including both fabrication and assembly constraint operations is described. The problem instance is established on the basis of benchmark FT10 operation data. It was preliminarily investigated by contrasting it to classical JSSP. A selective decoding string was constructed to overcome the unfeasible solutions resulting from chromosomes. Simulation tests indicate that the genetic decoding approach is both feasible and effective. Furthermore, they demonstrate that the assembly constraints have made a great difference in JSSP. Moreover, a near-optimal makespan of 2046 is obtained, which is better than the result of CP dispatching rule.

备注：新增回溯数据