期刊文献+

可重入柔性流水车间有限缓冲区容量动态预留方法

Dynamic reservation method of limited buffer capacity in reentrant flexible flow-shop
下载PDF
导出
摘要 当制造企业的生产车间缓冲区容量有限时,如果同时存在可重入工序,会产生一种严重的生产阻塞现象,即死锁现象,该现象会严重影响整个生产进程.本文首先建立具有可重入工序的柔性流水车间有限缓冲区排产(RFFLBS)问题的数学模型,在对死锁现象系统分析的基础上,提出了一种基于马尔可夫链的有限缓冲区动态容量预留方法(DBRMMC),DBRMMC通过主动为折返重入的工件预留缓冲区容量,减少工件对缓冲区资源的竞争,降低死锁现象出现的概率,并通过在DBRMMC方法中引入基于自适应阈值二值化算法的偏差补偿措施减小预测偏差,进一步抑制死锁现象的出现,并与基于高响应比优先算法(HRRN)的局部指派方法结合,给出一种改进的基于马尔可夫链的有限缓冲区容量动态预留方法(IDBRMMC-HRRN).建立多组仿真方案在不同数据规模下的进行测试,仿真结果表明IDBRMMC-HRRN方法能够有效的降低具有可重入工序的柔性流水车间有限缓冲区排产过程中死锁现象出现的概率,给出合理可行的排产结果. In manufacturing flow-shop,the buffer space is finite.If there exists reentrant process in products producing process,a serious production blocking,namely the deadlock,will probably occur,which will seriously affect the entire production process.To the end,a mathematical mode for reentrant flexible flow-shop with limited buffer is established,then,proposing a dynamic buffer reservation method based on Markov chain(DBRMMC)to solve the previous production blocking and deadlock problems by reserving buffer space for these reentrant jobs automatically,which can reduce the buffer space competition pressure from other jobs,thus to reduce the probability of deadlock occurrence.Besides,bringing self-adaptive threshold binarization algorithm into the DBRMMC to strengthen the ability of buffer dynamic reservation and propose an improved DBRMMC(IDBRMMC).Furthermore,combining the IDBRMMC and local dispatching rule based on the HRRN(highest response ratio next),IDBRMMC with local dispatching rule based on the HRRN(IDBRMMCHRRN)is generated.Finally,the comprehensive simulation experiments have been conducted to verify the effectiveness of the DBRM-RFFLBS.Results show that the DBRM-RFFLBS can effectively decrease the deadlock probability in RFFLBS and give smooth and feasible scheduling results.
作者 韩忠华 刘约翰 史海波 HAN Zhong-hua;LIU Yue-han;SHI Hai-bo(Key Laboratory of Networked Control Systems,Chinese Academy of Sciences,Shenyang Liaoning 110016,China;Shenyang Institute of Automation,Chinese Academy of Sciences,Shenyang Liaoning 110016,China;Institutes for Robotics and Intelligent Manufacturing,Chinese Academy of Sciences,Shenyang Liaoning 110169,China;University of Chinese Academy of Sciences,Beijing 100049,China;Faculty of Information and Control Engineering,Shenyang Jianzhu University,Shenyang Liaoning 110168,China)
出处 《控制理论与应用》 EI CAS CSCD 北大核心 2023年第11期2059-2073,共15页 Control Theory & Applications
基金 国家自然科学基金项目(61873174) 辽宁省重点研发计划项目(2020JH2/10100039) 辽宁省教育厅高等学校基本科研项目重点项目(LJKZ0583) 辽宁省科技厅应用基础研究计划项目(2022JH2/101300253)资助。
关键词 可重入工序 有限缓冲区 生产阻塞 死锁现象 马尔可夫链 reentrant process flow limited buffer spaces blocking situation deadlock Markov chain
  • 相关文献

参考文献2

二级参考文献24

  • 1Ezpeleta J,Colom J M,Martinez J.A Petri net based deadlock prevention policy for flexible manufacturing systems[J].IEEE Trans on Robotics and Automation,1995,11(2):173-184.
  • 2Reveliotis S A,Lawley M A,Ferreira P M.Polynomialcomplexity deadlock avoidance policies for sequential resource allocation systems[J].IEEE Trans on Automatic Control,1997,42(10):1344-1357.
  • 3Xing K Y,Zhou M C,Liu H X,et al.Optimal Petri-netbased polynomial-complexity deadlock-avoidance policies for automated manufacturing systems[J].IEEE Trans on Systems,Man and Cybernetics,Part A:Systems and Humans,2009,39(1):188-199.
  • 4Liu H X,Xing K Y,ZhouMC,et al.Transition cover-based design of petri net controllers for automated manufacturing systems[J].IEEE Trans on Systems,Man and Cybernetics:Part A,2014,43(2):196-208.
  • 5Abdallaht I B,Elmaraghy H A,Elmekkawy T.Deadlockfree scheduling in flexible manufacturing system using Petri nets[J].Int J of Production Research,2002,40(12):2733-2756.
  • 6Xu G,Wu Z M.Deadlock-free scheduling strategy for automated production cell[J].IEEE Trans on Systems,Man,and Cybernetics,Part A,2004,34(1):113-122.
  • 7Xing K Y,Han L B,Zhou M C.Deadlock-free genetic scheduling algorithm for automated manufacturing systems based on deadlock control policy[J].IEEE Trans on Systems,Man,and Cybernetics,Part B,2012,42(3):603-615.
  • 8Eberhart R,Kennedy J.A new optimizer using particle swarm theory[C].Proc of the 6th Int Symposium on Micro Machine and Human Science.Nagoya,1995:39-43.
  • 9Chen X,Li Y M.A modified PSO structure resulting in high exploration ability with convergence guaranteed[J].IEEE Trans on Systems,Man and Cybernetics,Part B,2007,37(5):1271-1289.
  • 10Lin T L,Horng 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.

共引文献21

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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