• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>International Journal of Computer Integrated Manufacturing >A nested partitioning-based approach to integrate process planning and scheduling in flexible manufacturing environment
【24h】

A nested partitioning-based approach to integrate process planning and scheduling in flexible manufacturing environment

机译：基于嵌套分区的方法，可在灵活的制造环境中集成过程计划和计划

获取原文
获取原文并翻译 | 示例
       
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Set-up planning is an important step in manufacturing a part type, and it can be used to integrate the manufacturing functions of process planning and scheduling. While considering the problem from optimisation perspective, set-up planning involves several issues such as grouping the features, tool approach direction (TAD) and machining operations. Here, we have considered the minimisation of total manufacturing cost, makespan and maximisation of the machine utilisation to obtain an optimal set-up plan while satisfying all the constraints. The cross-machine adaptive set-up planning (ASP) for a part is a nested partition (NP)-hard problem with flexible machining resources. Also, its impact on the integration of process planning and scheduling is a crucial step. The NP-based approach, which partitions the solution space, selecting the most promising region according to the formulated objective function, is adapted and reported in this article. This approach clusters the computational effort in the most promising region and also generates an exact optimal solution for underlying various set-up planning. The proposed algorithm has been tested by taking an illustrative example, and the results are compared with genetic algorithm. Further, five diverse scenarios are studied to prove the efficiency of the proposed approach.
机译：设置计划是制造零件类型的重要步骤，可用于集成过程计划和计划的制造功能。从优化的角度考虑问题时，安装计划涉及多个问题，例如，对特征进行分组，刀具进给方向（TAD）和加工操作。在这里，我们考虑了总制造成本的最小化，制造周期的最大化以及机器利用率的最大化，以在满足所有约束的同时获得最佳的安装计划。零件的跨机器自适应安装计划（ASP）是具有灵活加工资源的嵌套分区（NP）难题。同样，它对流程规划和计划集成的影响也是至关重要的一步。本文采用了基于NP的方法，该方法划分了解决方案空间，并根据制定的目标函数选择了最有希望的区域。这种方法将计算工作聚集在最有希望的区域，并且还为基础的各种设置计划生成了精确的最佳解决方案。通过举例说明对提出的算法进行了测试，并将结果与​​遗传算法进行了比较。此外，研究了五种不同的场景以证明所提出方法的效率。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号