期刊文献+

考虑次品处理的液压缸制造车间动态调度研究 被引量:1

Research on Dynamic Scheduling of Flexible Job Shop Considering Defect Handling
原文传递
导出
摘要 针对液压缸制造车间动态调度问题,构建了基于次品处理的动态调度优化模型,并以最大完工时间、在制品库存数量以及动态扰动量为目标,提出了一种改进帝国竞争算法对模型进行求解。在算法设计中,首先,设计了一种基于先到先加工策略的解码方式;其次,基于最小在制品库存数量,设计了混合初始化策略,以及基于关键路径的邻域搜索策略,以加快算法收敛速度,提升解的质量;最后,在帝国同化中设计了文化入侵过程,同时在帝国竞争中考虑保护最弱帝国以避免算法陷入局部最优。通过对不同规模的标准算例的算法对比仿真实验,以及对某液压缸柔性生产车间的实际工程案例分析,验证了所提算法的有效性。 For the hydraulic cylinder manufacturing workshop dynamic scheduling problem,a dynamic scheduling optimization model based on defect handling was constructed and an improved imperial competition algorithm was proposed to solve the model with the objectives of the maximum completion time,WIP(work in progress)inventory,and dynamic disturbance.In algorithm design,firstly,a decoding method based on the first-come-first-serve strategy is designed.Secondly,based on the minimum WIP inventory,a mixed initialization strategy and a neighborhood search strategy based on the critical path are designed to accelerate the convergence speed of the algorithm and improve the quality of the solution.Finally,the process of cultural invasion is designed in empire assimilation,and the weakest empire is protected in empire competition to avoid the algorithm from falling into local optimization.The validity of the proposed algorithm is verified through the simulation experiments of different scale standard examples,as well as the actual engineering case analysis of a hydraulic cylinder flexible production workshop.
作者 唐红涛 杨基源 张雁翔 张伟 TANG Hongtao;YANG Jiyuan;ZHANG Yanxiang;ZHANG Wei(School of Mechanical and Electronic Engineering,Wuhan University of Technology,Wuhan 430070,China;Shaoguan Hydraulic Parts Factory Co.Ltd.,Shaoguan 512000,China)
出处 《数字制造科学》 2023年第4期309-314,共6页
基金 国家自然科学基金资助项目(51705384,52075401)
关键词 质量扰动 改进帝国竞争优化算法 柔性作业车间 动态调度 quality disturbance improved imperial competition optimization algorithm flexible job workshop dynamic scheduling
  • 相关文献

参考文献6

二级参考文献57

  • 1吴秀丽,孙树栋,杨展,翟颖妮.多目标柔性Job Shop调度问题的技术现状和发展趋势[J].计算机应用研究,2007,24(3):1-5. 被引量:19
  • 2陆韡,张洁.基于事件及变周期驱动的作业车间动态调度[J].控制工程,2007,14(B05):209-213. 被引量:2
  • 3张超勇,饶运清,李培根,邵新宇.柔性作业车间调度问题的两级遗传算法[J].机械工程学报,2007,43(4):119-124. 被引量:105
  • 4GRABOWSKJ J, PEMPERA J. Some local search algorithms for no wait flow shop problem with make span criterion [ J]. Computers & Operations Research ,2005,32 ( 8 ) :2197-2122.
  • 5COOK S. The complexity of theorem-proving procedures[ C ]//Proc of the 3rd Annual ACM Symposium on Theory of Computing. New York:ACM Press, 1971 : 151-158.
  • 6GAREY M R, GRAHAM R L, JOHN D S. Performance guarantees for scheduling algorithms[J].Operations Research, 1978,26( 1 ) :3-21.
  • 7GONZALEZ T,SAHNI S. Flowshop and job shop schedules: complexity and approximation [ J]. Operations Research, 1978,26( 1 ) :36-52.
  • 8JANSEN K, MASTOLILLI M, SOLIS-OBA R. Approximation algorithms for flexible job shop problems [ J ]. International Journal of Foundations of Computer Science,2005,16 ( 2 ) :361 - 379.
  • 9MATI Y,REZG N,XIE Xiao-lan. An integrated greedy heuristic for a flexible job shop scheduling problem[ C ]//Proc of IEEE International Conference on Systems, Man, and Cybernetics. Piscataway: IEEE Press,2001:2534-2539.
  • 10LIM M K, ZHANG Z. A multi-agent based manufacturing control strategy for responsive manufacturing[ J]. Journal of Materials Processing Techno ogy,2003,139 ( 1-3 ) :379- 384.

共引文献71

同被引文献11

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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