• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>International Journal of Computer Integrated Manufacturing >Scheduling multiple parts in hybrid flow shop robotic cells served by a single robot
【24h】

Scheduling multiple parts in hybrid flow shop robotic cells served by a single robot

机译：安排由单个机器人服务的混合流水车间机器人单元中的多个零件

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

摘要

This paper addresses the robotic scheduling problem in blocking hybrid flow shop cells that consider multiple part-types, different speed parallel machines at each stage, machine eligibility constraints and a single transportation robot to move the parts between stages. Initially, a mixed integer linear programming (MILP) model is proposed to minimise the makespan. Due to the complexity of the model, a simulated annealing (SA)-based solution approach is developed to solve the problem. This approach uses both simple insertion method and a new neighbourhood structure based on block properties while generating neighbour solutions, which yields two different SA algorithms respectively. The performance of proposed SA approach is assessed over a set of randomly generated instances. The computational results demonstrate that the SA algorithm is effective with the employed neighbourhood structure for this problem.
机译：本文解决了阻塞混合流水车间单元中的机器人调度问题，该问题考虑了多个零件类型，每个阶段使用不同速度的并行机器，机器合格性限制以及一个在各个阶段之间移动零件的运输机器人。最初，提出了混合整数线性规划（MILP）模型以最小化制造期。由于模型的复杂性，开发了一种基于模拟退火（SA）的解决方案来解决该问题。该方法同时使用简单插入方法和基于块属性的新邻域结构，同时生成邻居解决方案，分别产生两种不同的SA算法。建议的SA方法的性能是在一组随机生成的实例上进行评估的。计算结果表明，该算法对所采用的邻域结构有效。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号