• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Computers & operations research >A scheduling problem in blocking hybrid flow shop robotic cells with multiple robots
【24h】

A scheduling problem in blocking hybrid flow shop robotic cells with multiple robots

机译：具有多个机器人的混合流水车间机器人单元的调度问题

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

摘要

This paper addresses the robotic scheduling problem in blocking hybrid flow shop cells that consider multiple part types, unrelated parallel machines, multiple robots and machine eligibility constraints. Initially, a mixed integer linear programming (MILP) model is proposed to minimize the makespan for this problem. Due to the complexity of the model, a simulated annealing (SA) based solution approach is developed for its solution. To increase the efficiency of the SA algorithm, a new neighborhood structure based on block properties is applied. The performance of the proposed SA is assessed over a set of randomly generated instances. The computational results demonstrate that the SA algorithm is effective with the employed neighborhood structure. Additionally, this study shows that the appropriate number of robots depends on the sequence of processing operations to be performed at each stage.
机译：本文解决了在考虑多个零件类型，无关并行机器，多个机器人和机器资格约束的混合流水车间单元中的机器人调度问题。最初，提出了混合整数线性规划（MILP）模型以最小化此问题的有效期。由于模型的复杂性，针对其解决方案开发了基于模拟退火（SA）的解决方案。为了提高SA算法的效率，应用了基于块属性的新邻域结构。建议SA的性能是在一组随机生成的实例上进行评估的。计算结果表明，SA算法对所采用的邻域结构有效。此外，这项研究表明，适当数量的机器人取决于每个阶段要执行的处理操作的顺序。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号