An Approximate Solution Method for Optimal Buffer Allocation in Serial n-stage Automatic Production Lines : Series C : Vibration, Control Engineering, Engineering for Industry

H. Yamashita, Shigemichi Suzuki
{"title":"An Approximate Solution Method for Optimal Buffer Allocation in Serial n-stage Automatic Production Lines : Series C : Vibration, Control Engineering, Engineering for Industry","authors":"H. Yamashita, Shigemichi Suzuki","doi":"10.1299/KIKAIC.53.807","DOIUrl":null,"url":null,"abstract":"In this paper we consider the allocation of buffer capacities in a serial, synchronized, automatic production line with buffer storages between adjacent stages. It is assumed that every stage has a geometric distribution of up time. The measure of line efficiency is the maximum output rate from the last stage of the line in the steady state which is referred to as production rate. First, we develop in this paper a new efficient method of calculation of production rate which is suitable for applying dynamic programming approaches. Then, we propose an approximate solution method for optimal buffer allocation so as to maximize production rate applicable even to long lines with many buffer storages and a large total buffer capacity by applying dynamic programming techniques. We confirm the validity of the approach by comparing the solutions obtained by the present method with those obtained by computer simulation for many example problems.","PeriodicalId":286527,"journal":{"name":"JSME international journal : bulletin of the JSME","volume":"45 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1987-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"14","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"JSME international journal : bulletin of the JSME","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1299/KIKAIC.53.807","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 14

Abstract

In this paper we consider the allocation of buffer capacities in a serial, synchronized, automatic production line with buffer storages between adjacent stages. It is assumed that every stage has a geometric distribution of up time. The measure of line efficiency is the maximum output rate from the last stage of the line in the steady state which is referred to as production rate. First, we develop in this paper a new efficient method of calculation of production rate which is suitable for applying dynamic programming approaches. Then, we propose an approximate solution method for optimal buffer allocation so as to maximize production rate applicable even to long lines with many buffer storages and a large total buffer capacity by applying dynamic programming techniques. We confirm the validity of the approach by comparing the solutions obtained by the present method with those obtained by computer simulation for many example problems.
串联n级自动生产线缓冲优化分配的近似求解方法。C辑:振动,控制工程,工业工程
本文研究了串行同步自动生产线中相邻工序间存在缓冲存储器的缓冲容量分配问题。假设每个阶段的启动时间呈几何分布。生产线效率的度量是生产线在稳定状态下从最后阶段开始的最大产出率,称为生产率。首先,本文提出了一种适用于动态规划方法的生产率计算新方法。在此基础上,应用动态规划技术,提出了一种适用于具有多个缓冲存储器和较大总缓冲容量的长生产线的生产率最大化的缓冲区最优分配近似求解方法。通过将该方法与计算机仿真得到的解进行比较,验证了该方法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信