当前位置: X-MOL 学术IISE Trans. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Queuing approximations for capacity planning under common setup rules
IISE Transactions ( IF 2.0 ) Pub Date : 2020-10-09 , DOI: 10.1080/24725854.2020.1815105
Esma S. Gel 1 , John W. Fowler 2 , Ketan Khowala 1
Affiliation  

Abstract

We consider the problem of estimating the resulting utilization and cycle times in manufacturing settings that are subject to significant capacity losses due to setups when switching between different product or part types. In particular, we develop queuing approximations for a multi-item server with sequence-dependent setups operating under four distinct setup rules that we have determined to be common in such settings: first-in-first-out, setup avoidance, setup minimization and type priority. We first derive expressions for the setup utilization and overall utilization, and use Kingman’s well-known approximation to estimate the average cycle time at the station under each setup rule. We test the accuracy of the approximations using a simulation experiment, and provide insights on the use of different setup rules under various conditions.



中文翻译:

通用设置规则下容量规划的排队近似值

摘要

我们考虑了在不同产品或零件类型之间切换时,由于设置而导致显着容量损失的制造设置中估计由此产生的利用率和周期时间的问题。特别是,我们为具有序列相关设置的多项目服务器开发了排队近似值,这些设置在四种不同的设置规则下运行,我们已确定这些规则在此类设置中很常见:先进先出、设置避免、设置最小化和类型优先权。我们首先推导出设置利用率和总体利用率的表达式,并使用 Kingman 众所周知的近似值来估计每个设置规则下站点的平均循环时间。我们使用模拟实验测试近似值的准确性,并提供有关在各种条件下使用不同设置规则的见解。

更新日期:2020-10-09
down
wechat
bug