SIA OpenIR  > 数字工厂研究室
A Dynamic Buffer Reservation Method Based on Markov Chain to Solve Deadlock Problem in Scheduling
Han ZH(韩忠华)1,2,3,4; Liu, Yuehan1; Shi HB(史海波)2,3; Tian, Xutian1
Department数字工厂研究室
Conference Name11th International Conference on Modelling, Identification and Control, ICMIC 2019
Conference DateJuly 13-15, 2019
Conference PlaceTianjin, China
Source PublicationProceedings of the 11th International Conference on Modelling, Identification and Control, ICMIC 2019
PublisherSpringer
Publication PlaceBerlin
2019
Pages1205-1213
Indexed ByEI
EI Accession number20195207923990
Contribution Rank1
ISSN1876-1100
ISBN978-981-15-0473-0
KeywordFlexible flow shop Reentrant process Limited buffer Deadlock situation Markov Chain
AbstractIn 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.
Language英语
Document Type会议论文
Identifierhttp://ir.sia.cn/handle/173321/26136
Collection数字工厂研究室
Corresponding AuthorLiu, Yuehan
Affiliation1.Faculty of Information and Control Engineering, Shenyang Jianzhu University, Shenyang 110168, China
2.Department of Digital Factory, Shenyang Institute of Automation, Chinese Academy of Sciences, Shenyang 110016, China
3.Key Laboratory of Network Control System, Chinese Academy of Sciences, Shenyang, Liaoning 110016, China
4.Institutes for Robotics and Intelligent Manufacturing, Chinese Academy of Sciences, Shenyang
5.Liaoning
6.110016, China
Recommended Citation
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]. Berlin:Springer,2019:1205-1213.
Files in This Item: Download All
File Name/Size DocType Version Access License
A Dynamic Buffer Res(478KB)会议论文 开放获取CC BY-NC-SAView Download
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Han ZH(韩忠华)]'s Articles
[Liu, Yuehan]'s Articles
[Shi HB(史海波)]'s Articles
Baidu academic
Similar articles in Baidu academic
[Han ZH(韩忠华)]'s Articles
[Liu, Yuehan]'s Articles
[Shi HB(史海波)]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Han ZH(韩忠华)]'s Articles
[Liu, Yuehan]'s Articles
[Shi HB(史海波)]'s Articles
Terms of Use
No data!
Social Bookmark/Share
File name: A Dynamic Buffer Reservation Method Based on Markov Chain to Solve Deadlock Problem in Scheduling.pdf
Format: Adobe PDF
This file does not support browsing at this time
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.