【摘要】 描述了同时考虑加工与装配作业的多产品综合作业调度问题,利用经典作业调度问题FT10的数据构造了一个问题例子,设计了基于产品结构信息的字符串直接解码方法.计算结果表明:设计的遗传算法是可行和有效的,得到的装配完工时间接近无限能力概念下得到的最小值,并且优于关键路径调度规则的结果.更多还原

【Abstract】 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.更多还原