A Dynamic Buffer Reservation Method Based on Markov Chain to Solve Deadlock Problem in Scheduling
文献类型:会议论文
作者 | Han ZH(韩忠华)1,2,3,4![]() ![]() |
出版日期 | 2019 |
会议日期 | July 13-15, 2019 |
会议地点 | Tianjin, China |
关键词 | Flexible flow shop Reentrant process Limited buffer Deadlock situation Markov Chain |
页码 | 1205-1213 |
英文摘要 | In order to solve the problem of the deadlock situation which usually happens in the process of Re-entrant Flexible Flow-shop with Limited Buffer Scheduling (RFFLBS), this paper focuses on the study of Dynamic Buffer Reservation Method Based on Markov Chain, DBRM-MC. The occurrence of the deadlock situation will be reduced by actively reserving buffer capacity for reentry jobs to reduce the competition for other buffer resources from non-reentrant processes. The mathematical model of RFFLBS is established and the simulation test is carried out. The test results show that the dynamic buffer reservation method based on Markov Chain can effectively decreases the deadlock situation. |
产权排序 | 1 |
会议录 | Proceedings of the 11th International Conference on Modelling, Identification and Control, ICMIC 2019
![]() |
会议录出版者 | Springer |
会议录出版地 | Berlin |
语种 | 英语 |
ISSN号 | 1876-1100 |
ISBN号 | 978-981-15-0473-0 |
WOS记录号 | WOS:000612991700112 |
源URL | [http://ir.sia.cn/handle/173321/26136] ![]() |
专题 | 沈阳自动化研究所_数字工厂研究室 |
通讯作者 | Liu, Yuehan |
作者单位 | 1.Key Laboratory of Network Control System, Chinese Academy of Sciences, Shenyang, Liaoning 110016, China 2.Department of Digital Factory, Shenyang Institute of Automation, Chinese Academy of Sciences, Shenyang 110016, China 3.Faculty of Information and Control Engineering, Shenyang Jianzhu University, Shenyang 110168, China 4.Institutes for Robotics and Intelligent Manufacturing, Chinese Academy of Sciences, Shenyang, Liaoning 110016, China |
推荐引用方式 GB/T 7714 | Han ZH,Liu, Yuehan,Shi HB,et al. A Dynamic Buffer Reservation Method Based on Markov Chain to Solve Deadlock Problem in Scheduling[C]. 见:. Tianjin, China. July 13-15, 2019. |
入库方式: OAI收割
来源:沈阳自动化研究所
浏览0
下载0
收藏0
其他版本
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。