Analysis of two-machine lines with multiple failure modes and unreliable buffer | |
Liu, Jun; Liu, Jie; Rui, Zhi-Yuan; Zhao, Jun-Tian | |
2008 | |
会议名称 | 2008 IEEE International Symposium on Knowledge Acquisition and Modeling Workshop, KAM 2008 |
会议录名称 | 2008 IEEE International Symposium on Knowledge Acquisition and Modeling Workshop Proceedings, KAM 2008 |
页码 | 36-39 |
会议日期 | December 21, 2008 - December 22, 2008 |
会议地点 | Wuhan, China |
出版者 | IEEE Computer Society |
摘要 | This paper presents an method for evaluating the performance of production lines with a finite buffer and two unreliable machines. In this system, each machine can fail in more than one way, and the buffer also can fail. We study the transitions of the states probabilities based on the discrete model, a corresponding algorithm are developed here, and an approximate technique is proposed to evaluate the performance of hybrid production systems. The experiment confirms that this method is a robust one. © 2008 IEEE. |
关键词 | Hybrid systems Discrete modeling Finite buffer Hybrid production Multiple failure modes Production line Two machines Unreliable buffer Unreliable machine |
DOI | 10.1109/KAMW.2008.4810418 |
收录类别 | EI |
语种 | 英语 |
EI入藏号 | 20092812179600 |
EI主题词 | Knowledge acquisition |
来源库 | Compendex |
分类代码 | 723.4 Artificial Intelligence - 921 Mathematics |
引用统计 | |
文献类型 | 会议论文 |
条目标识符 | https://ir.lut.edu.cn/handle/2XXMBERH/116570 |
专题 | 机电工程学院 兰州理工大学 |
作者单位 | School of Mechanical and Electrical Engineering, Lanzhou University of Technology, Lanzhou, 730050, China |
第一作者单位 | 兰州理工大学 |
推荐引用方式 GB/T 7714 | Liu, Jun,Liu, Jie,Rui, Zhi-Yuan,et al. Analysis of two-machine lines with multiple failure modes and unreliable buffer[C]:IEEE Computer Society,2008:36-39. |
条目包含的文件 | 条目无相关文件。 |
个性服务 |
查看访问统计 |
谷歌学术 |
谷歌学术中相似的文章 |
[Liu, Jun]的文章 |
[Liu, Jie]的文章 |
[Rui, Zhi-Yuan]的文章 |
百度学术 |
百度学术中相似的文章 |
[Liu, Jun]的文章 |
[Liu, Jie]的文章 |
[Rui, Zhi-Yuan]的文章 |
必应学术 |
必应学术中相似的文章 |
[Liu, Jun]的文章 |
[Liu, Jie]的文章 |
[Rui, Zhi-Yuan]的文章 |
相关权益政策 |
暂无数据 |
收藏/分享 |
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。
修改评论