...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Engineering Optimization >A genetic algorithm for a re-entrant job-shop scheduling problem with sequence-dependent setup times
【24h】

A genetic algorithm for a re-entrant job-shop scheduling problem with sequence-dependent setup times

机译：具有序列依赖建立时间的可重入作业车间调度问题的遗传算法

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

摘要

This article addresses a re-entrant job-shop scheduling problem with sequence-dependent setup times. The disjunctive graph model with the objective of the minimum makespan is used to capture the interactions between machines. On the basis of this representation, two heuristic procedures and a genetic algorithm are proposed to obtain near-optimal solutions for this problem. Also, an experimental design method for determining the various genetic parameters based on the Taguchi approach is presented. A comparative study is conducted to examine the performance of these proposed algorithms and the results show that the genetic algorithm outperforms the other heuristic procedures, which are modified versions of recently published existing methods.
机译：本文介绍了与序列相关的设置时间的可重入作业车间调度问题。以最小制造期为目标的析取图模型用于捕获机器之间的交互。在此表示的基础上，提出了两种启发式程序和一种遗传算法来获得该问题的最佳解。此外，提出了一种基于田口方法确定各种遗传参数的实验设计方法。进行了比较研究，以检验这些算法的性能，结果表明，遗传算法的性能优于其他启发式程序，后者是最近发布的现有方法的改进版本。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号