首页> 外文期刊>International journal of management science and engineering management >Efficient meta heuristic algorithms to minimize mean flow time in no-wait two stage flow shops with parallel and identical machines
【24h】

Efficient meta heuristic algorithms to minimize mean flow time in no-wait two stage flow shops with parallel and identical machines

机译:高效的元启发式算法可最大程度地减少平行且相同机器的无等待两级流程车间的平均流程时间

获取原文
获取原文并翻译 | 示例
           

摘要

The no-wait two stage flexible manufacturing problem is an important problem in flow shops. This paper investigates the no-wait two stage flexible flow shop with a minimizing mean flow time performance measure. Six meta-heuristic algorithms are developed to solve the problem. In addition some numerical experiments are established to compare the efficiency of the proposed algorithms to each other. The results of the simulation study are illustrated to testify to the performance of the proposed algorithms. This is followed by proposing the most efficient algorithm and giving concluding remarks and potential areas for further research.
机译:无等待的两阶段柔性制造问题是流水车间中的重要问题。本文研究了一种具有最小化平均流动时间性能指标的无等待两阶段柔性流水车间。开发了六种元启发式算法来解决该问题。另外,建立了一些数值实验以将所提出算法的效率彼此进行比较。仿真研究的结果说明了所提出算法的性能。其次,提出了最有效的算法,并给出了结论和潜在领域,以供进一步研究。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号