• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>International Conference on Environmental and Materials Engineering >Methods Algorithms in Manufacturing and Assembly Industry Scheduling for Flexible Manufacturing System
【24h】

Methods Algorithms in Manufacturing and Assembly Industry Scheduling for Flexible Manufacturing System

机译：柔性制造系统制造和装配行业调度的方法与算法

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Flexible Manufacturing Systems-FMS is a term with various types of definitions, each of them trying to describe the complexity and the generalized features. One of these features is their complexity, along with difficulties in building models that capture the system in all its important aspects. In a heterogeneous flexible system, the scheduling events or actions could be a combinatorial problem which claims a particular solution. Manufacturing scheduling process, in special for FMS, is a very difficult scheduling problem, because involves all the aspects of the processes: order, resources, transportation system i.e. automated vehicle guided, perturbation factors such as breakdowns of machine, etc. Typically, the scheduling problem is a NP-hard problem modeled in mathematical form. If we simulate n jobs or orders which have to be assigned to the m machines or resources, we will observe that the mathematical solution is a huge number that means (n!)~m possibilities of solutions. The challenge of researchers is to solve this equation in a reasonable time with an optimal solution, and of course with minimal resources. Those scientists applied many solutions which became Operational Research-OR or Combinatorial Optimization-CO areas using a various methods: Local Search-LS, Artificial Intelligence-AI, heuristic method, priority rules, memetic or hybrid techniques which combine this techniques.
机译：灵活的制造系统-FMS是一个具有各种类型的定义的术语，每个都试图描述复杂性和广义特征。其中一个特征是它们的复杂性，以及建筑模型中的困难，在所有重要方面都捕获系统。在异构灵活的系统中，调度事件或动作可以是组合问题，其声称特定解决方案。制造调度过程，在FMS的特殊情况下，是一个非常困难的调度问题，因为涉及过程的所有方面：订单，资源，运输系统，即自动化车辆引导，扰动因素如机器崩溃等。通常，调度问题是以数学形式建模的NP硬质问题。如果我们模拟必须分配给M机器或资源的N个工作或订单，我们将观察到数学解决方案是一个巨大的数字，这意味着（n！）〜m解决方案的可能性。研究人员的挑战是通过最佳解决方案在合理的时间内解决这个方程，当然是最少的资源。这些科学家使用各种方法应用了许多解决方案，该解决方案是使用各种方法的运营研究 - 或或组合优化 - CO领域：本地搜索-L，人工智能-AI，启发式方法，优先规则，麦片或混合技术，这些技术结合了这种技术。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号