不可靠传输线吞吐量最大化

J. Sadr, R. Malhamé
{"title":"不可靠传输线吞吐量最大化","authors":"J. Sadr, R. Malhamé","doi":"10.1109/WODES.2002.1167711","DOIUrl":null,"url":null,"abstract":"Given a transfer line with individual machines reliability data, and given fixed size buffer zones for work in process across the transfer line, the objective is to determine the transfer line maximal sustainable mean production rate. We present a recursive algorithm based on a recently developed transfer line decomposition technique to evaluate a maximal sustainable throughput. The algorithm derived provably converges. Numerical results are compared with those obtained based on other competing algorithms in the literature for similar transfer lines.","PeriodicalId":435263,"journal":{"name":"Sixth International Workshop on Discrete Event Systems, 2002. Proceedings.","volume":"57 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2002-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Unreliable transfer lines throughput maximization\",\"authors\":\"J. Sadr, R. Malhamé\",\"doi\":\"10.1109/WODES.2002.1167711\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Given a transfer line with individual machines reliability data, and given fixed size buffer zones for work in process across the transfer line, the objective is to determine the transfer line maximal sustainable mean production rate. We present a recursive algorithm based on a recently developed transfer line decomposition technique to evaluate a maximal sustainable throughput. The algorithm derived provably converges. Numerical results are compared with those obtained based on other competing algorithms in the literature for similar transfer lines.\",\"PeriodicalId\":435263,\"journal\":{\"name\":\"Sixth International Workshop on Discrete Event Systems, 2002. Proceedings.\",\"volume\":\"57 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2002-10-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Sixth International Workshop on Discrete Event Systems, 2002. Proceedings.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WODES.2002.1167711\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Sixth International Workshop on Discrete Event Systems, 2002. Proceedings.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WODES.2002.1167711","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

给定一条具有单个机器可靠性数据的传输线,以及给定固定大小的传输线在制品缓冲区,目标是确定传输线的最大可持续平均生产率。我们提出了一种基于最近发展的传输线分解技术的递归算法来评估最大可持续吞吐量。该算法具有可证明的收敛性。数值结果与文献中基于其他竞争算法的结果进行了比较。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Unreliable transfer lines throughput maximization
Given a transfer line with individual machines reliability data, and given fixed size buffer zones for work in process across the transfer line, the objective is to determine the transfer line maximal sustainable mean production rate. We present a recursive algorithm based on a recently developed transfer line decomposition technique to evaluate a maximal sustainable throughput. The algorithm derived provably converges. Numerical results are compared with those obtained based on other competing algorithms in the literature for similar transfer lines.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信