期刊文献+

存在多设备工序的综合调度算法 被引量:5

Integrated Scheduling Algorithm with Multiple-devices-operation
下载PDF
导出
摘要 针对工序集中存在需要多台设备协同完成加工的多设备工序的综合调度问题,提出一种把多设备工序设计成在多个相关设备上同时加工的多个虚拟工序的方法。该算法把产品加工树转化为多设备工序被设计成虚拟工序组的虚拟加工工艺树,为了优先调度虚拟工序组,将虚拟加工工艺树分解为以虚拟工序组为根结点的子树和剩余标准工序组成的子树,优先调度以虚拟工序组为根结点的子树;当以虚拟工序组为根结点的子树不唯一时,按子树上虚拟工序组个数多少确定子树的调度次序;对每个以虚拟工序组为根结点的子树,优先调度虚拟工序组个数较多的路径上工序;为了使相关虚拟工序同时开始加工,提出虚拟工序动态调整策略。理论分析和实例表明,所提出的调度算法能够较好地解决存在多设备工序的综合调度问题。 Aiming at integrated scheduling problem with multiple-devices-operation, a method to change multiple-devices-operation into multiple related virtual operations which processes on multiple related machines at the same time is proposed. Product processing tree is changed into virtual processing tree, on which each multiple-devices-operation is changed into a virtual operation group. Virtual processing tree is decomposed into subtree whose root node is virtual operation group and subtree that composed of remaining standard operations. The subtree whose root node is virtual operation group is scheduled previously; When the subtree whose root node is virtual operation group is not unique, the scheduling order of the subtree is determined according to the number of virtual operation group. The scheduling order of operations on subtree whose root node is virtual operation group is determined according to the number of virtual operation group on the path. In order to make related virtual operations start at the same time, virtual operation dynamic adjustment strategy is proposed. Theoretical analysis and examples show that the scheduling algorithm proposed is an effective solution to the scheduling problem with multiple-devices-operation.
出处 《机械工程学报》 EI CAS CSCD 北大核心 2014年第24期191-200,共10页 Journal of Mechanical Engineering
基金 国家自然科学基金(60873019 61370086 61370083) 黑龙江省自然科学基金(F201101) 黑龙江省教育厅科技(12531105) 黑龙江省博士后科研启动(LBH-Q13092) 现代制造技术与刀具开发黑龙江省高校重点实验室开放课题(2012DJ-003)资助项目
关键词 综合调度 多设备工序 虚拟工序 虚拟工序组 虚拟工序动态调整策略 integrated scheduling multiple-devices-operation virtual operation virtual operation group virtual operation dynamicadjustment strategy
  • 相关文献

参考文献17

  • 1ZHANG H P, GEN M. Multistage-based genetic algorithm for flexible job-shop scheduling problem[J]. Complexity International, 2005, 11 : 223-232.
  • 2YOO Y B, HELZER D. The parallel genetic algorithm for the job shop scheduling problem[C]//Proceedings of the IASTED International Conference on Artificial Intelligence and Soft Computing, 2003, 7: 249-254.
  • 3ENGIN O, CERAN G, YILMAZ M K. An efficient genetic algorithm for hybrid flow shop scheduling with multiprocessor task problems[J]. Applied Soft Computing Journal, 2011, 11(3): 3056-3065.
  • 4MIRSANEI H S, ZANDIEH M, MOAYED M J, et al. A simulated annealing algorithm approach to hybrid flow shop scheduling with sequence-dependent setup times [J]. Journal of Intelligent Manufacturing, 2011, 22(6): 965-978.
  • 5GLOVER F. Future paths for integer programming and links to artificial intelligence[J]. Computers & Operations Research, 1986, 13(5): 533-549.
  • 6FOO Y S, TAKEFUJI Y. Stochastic neural networks for solving job-shop scheduling[C/CD]//Problem Representation, Stochastic Neural Networks for Solving Job-shop Scheduling: Part2. Architecture and Simulations. IEEE International Conference on Neural Networks, San Diego, 1998.
  • 7熊禾根,李建军,孔建益,杨金堂,蒋国璋.考虑工序相关性的动态Job shop调度问题启发式算法[J].机械工程学报,2006,42(8):50-55. 被引量:33
  • 8闫利军,李宗斌,卫军胡,杜轩.一种新的混合优化算法及其在车间调度中的应用[J].自动化学报,2008,34(5):604-608. 被引量:8
  • 9张长胜,孙吉贵,杨轻云,郑黎辉.一种求解车间调度的混合算法[J].自动化学报,2009,35(3):332-336. 被引量:13
  • 10LINT L, HORONG S J, KAO T W, et al. An efficient job-shop scheduling algorithm based on particle swarm optimization[J]. Expert Systems with Applications, 2010, 37(3): 2629-2636.

二级参考文献87

共引文献114

同被引文献60

引证文献5

二级引证文献18

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部