首页> 外文会议>Annual genetic and evolutionary computation conference;GECCO-2010 >Towards Improved Dispatching Rules for Complex Shop Floor Scenarios—a Genetic Programming Approach
【24h】

Towards Improved Dispatching Rules for Complex Shop Floor Scenarios—a Genetic Programming Approach

机译:面向复杂车间场景的改进调度规则-一种遗传规划方法

获取原文

摘要

Developing dispatching rules for manufacturing systems is a tedious process, which is time- and cost-consuming. Since there is no good general rule for different scenarios and objectives automatic rule search mechanism are investigated. In this paper an approach using Genetic Programming (GP) is presented. The priority rules generated by GP are evaluated on dynamic job shop scenarios from literature and compared with manually developed rules yielding very promising results also interesting for Simulation Optimization in general.
机译:为制造系统制定调度规则是一个繁琐的过程,既费时又费钱。由于没有针对不同场景和目标的良好通用规则,因此对自动规则搜索机制进行了研究。在本文中,提出了一种使用遗传编程(GP)的方法。 GP生成的优先级规则是根据文献中的动态作业车间方案进行评估的,并与手动开发的规则进行比较,从而产生非常有希望的结果,这通常对于“模拟优化”也很有趣。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号