论文部分内容阅读
为解决目前生产中出现的复合材料结构件的质量缺陷问题,G公司设立了复合材料结构件返修工序。针对结构件返修计划问题,以最大化返修计划中的结构件数量为目标,同时兼顾公司出货计划延迟和WIP成本(在制品成本)增加的情况,建立了0-1整数规划模型,进而以蚁群算法为基础提出了2种伪随机选择规则。根据实际情况采用不同参数设计算例来验证算法的性能。结果表明在最大化返修结构件数量方面,算法一优于算法二,而在减小公司出货延迟和控制WIP成本方面,算法二优于算法一。
In order to solve the problem of quality defects of the composite structural members presently produced in the market, G Company has set up the repairing process of the composite structural members. Aiming at the problem of repairing plan of structure parts, the 0-1 integer programming model is established with the goal of maximizing the number of structural parts in rework plan and taking into account the delay of shipping plan and the increase of WIP cost (work-in-process cost) Ant Colony Algorithm based on the proposed two kinds of pseudo-random selection rules. According to the actual situation, different parameters are used to verify the performance of the algorithm. The results show that algorithm 1 is superior to algorithm 2 in maximizing the number of rework components, while algorithm 2 is superior to algorithm 1 in reducing the company’s shipping delays and controlling WIP costs.