首页> 外文期刊>International Journal of Production Research >A new approach to the cell formation problem with alternative processing routes and operation sequence
【24h】

A new approach to the cell formation problem with alternative processing routes and operation sequence

机译:具有替代处理路径和操作顺序的细胞形成问题的新方法

获取原文
获取原文并翻译 | 示例
       

摘要

Cellular manufacturing (CM) is an important application of group technology in manufacturing systems. One of the crucial steps in the design of CM is the identification of part families and manufacturing cells. This problem is referred to as cell formation problem (CFP) in the literature. In this article, a solution approach is proposed for CFP, which considers many parameters such as machine requirement, sequence of operations, alternative processing routes, processing time, production volume, budget limitation, cost of machines, etc. Due to the NP-hardness of CFP, it cannot be efficiently solved for medium- to large-sized problems. Thus, a genetic algorithm (GA) is proposed to solve the formulated model. Comparison of the results obtained from the proposed GA to the globally optimum solutions obtained by Lingo Software and those reported in the literature reveals the effectiveness and efficiency of the proposed approach.
机译:蜂窝制造(CM)是组技术在制造系统中的重要应用。 CM设计中的关键步骤之一是识别零件族和制造单元。该问题在文献中称为细胞形成问题(CFP)。在本文中,为CFP提出了一种解决方案方法,该方法考虑了许多参数,例如机器需求,操作顺序,替代加工路线,加工时间,产量,预算限制,机器成本等。由于NP硬度CFP不能解决大中型问题。因此,提出了一种遗传算法(GA)来求解该模型。从拟议的遗传算法获得的结果与Lingo Software获得的全局最优解以及文献报道的结果进行比较,发现了拟议方法的有效性和效率。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号