...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Journal of Intelligent Manufacturing >Design of an efficient genetic algorithm for resource-constrained unrelated parallel machine scheduling problem with machine eligibility restrictions
【24h】

Design of an efficient genetic algorithm for resource-constrained unrelated parallel machine scheduling problem with machine eligibility restrictions

机译：利用机器资格限制设计资源受限无关机会调度问题的高效遗传算法

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

摘要

This study addresses a resource-constrained unrelated parallel machine scheduling problem with machine eligibility restrictions. Majority of the traditional scheduling problems in parallel machine environment deal with machine as the only resource. However, other resources such as labors, tools, jigs, fixtures, pallets, dies, and industrial robots are not only required for processing jobs but also are often restricted. Considering other resources makes the scheduling problems more realistic and practical to implement in manufacturing environments. First, an integer mathematical programming model with the objective of minimizing makespan is developed for this problem. Noteworthy, due to NP-hardness of the considered problem, application of meta-heuristic is avoidable. Furthermore, two new genetic algorithms including a pure genetic algorithm and a genetic algorithm along with a heuristic procedure are proposed to tackle this problem. With regard to the fact that appropriate design of the parameters has a significant effect on the performance of algorithms, hence, we calibrate the parameters of these algorithms by using the response surface method. The performance of the proposed algorithms is evaluated by a number of numerical examples. The computational results demonstrated that the proposed genetic algorithm is an effective and appropriate approach for our investigated problem.
机译：本研究解决了机器资格限制的资源受限无关的不​​相关的并行机器调度问题。大多数并联机器环境中的传统调度问题与机器作为唯一的资源处理。但是，诸如劳动，工具，夹具，夹具，托盘，模具和工业机器人等其他资源不仅需要加工工作，而且通常受到限制。考虑到其他资源使调度问题在制造环境中实现更加现实和实用。首先，为这个问题开发了一个具有最小化MakEspan的目的的整数数学编程模型。值得注意的是，由于所考虑的问题的NP硬度，可以避免荟萃启发式的应用。此外，提出了两个新的遗传算法，包括纯遗传算法和遗传算法以及启发式程序来解决这个问题。关于该参数的适当设计对算法的性能具有显着影响，因此我们使用响应表面方法校准这些算法的参数。所提出的算法的性能由许多数值例子评估。计算结果表明，拟议的遗传算法是我们调查问题的有效和适当的方法。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号