Real-time Performance Evaluation of Assembly Systems With Three Bernoulli Machines and Finite Production Runs

被引:0
|
作者
Liu C. [1 ,2 ]
Jia Z.-Y. [1 ,2 ]
机构
[1] School of Automation, Beijing Institute of Technology, Beijing
[2] Key Laboratory of Intelligent Control and Decision of Complex Systems, Beijing
来源
基金
中国博士后科学基金;
关键词
Assembly systems; Bernoulli machine; Real-time performance evaluation; Transient analysis;
D O I
10.16383/j.aas.c170685
中图分类号
学科分类号
摘要
Steady state analysis of production, which is usually applicable to large-volume manufacturing systems, has been extensively studied during the past several decades. However, when the volume of the production is relatively small (e.g., finite production run-based operation with small run sizes), transient may play a major role during the production process and steady state analysis may become inapplicable. A few preliminary results have been derived for analyzing serial lines with finite production runs in recent years. Since assembly systems are also widely used in practice, where the final product requires several components, under the framework of finite production run-based assembly systems with finite buffers and with three machines having the Bernoulli reliability model, the problem of performance evaluation of such systems is investigated in this paper. Specifically, a mathematical model and analytical formulas to evaluate performances of the system are derived first. Then, a decomposition-based algorithm for performance approximation is also proposed and formulas for estimating the transient performance are derived. The accuracy of the algorithm is validated by numerical experiments and demonstrated by a numerical example. Copyright © 2019 Acta Automatica Sinica. All rights reserved.
引用
收藏
页码:471 / 479
页数:8
相关论文
共 24 条
  • [1] Harrison J.M., Assembly-like queues, Journal of Applied Probability, 10, 2, pp. 354-367, (1973)
  • [2] Lipper E.H., Sengupta B., Assembly-like queues with finite capacity: bounds, asymptotics and approximations, Queueing Systems, 1, 1, pp. 67-83, (1986)
  • [3] Kuo C.T., Lim J.T., Meerkov S.M., Park E., Improvability theory for assembly systems: two component-one assembly machine case, Mathematical Problems in Engineering, 3, 2, pp. 95-171, (1997)
  • [4] Manitz M., Analysis of assembly/disassembly queueing networks with blocking after service and general service times, Annals of Operations Research, 226, 1, pp. 417-441, (2015)
  • [5] Gershwin S.B., Assembly/disassembly systems: an efficient decomposition algorithm for tree-structured networks, IIE Transactions, 23, 4, pp. 302-314, (1991)
  • [6] Liu X.G., Buzacott J.A., Approximate models of assembly systems with finite inventory banks, European Journal of Operational Research, 45, 2-3, pp. 143-154, (1990)
  • [7] Di Mascolo M., David R., Dallery Y., Modeling and analysis of assembly systems with unreliable machines and finite buffers, IIE Transactions, 23, 4, pp. 315-330, (1991)
  • [8] Chiang S.Y., Kuo C.T., Lim J.T., Meerkov S.M., Improvability of assembly systems I: problem formulation and performance evaluation, Mathematical Problems in Engineering, 6, 4, pp. 321-357, (2000)
  • [9] Chiang S.Y., Kuo C.T., Lim J.T., Meerkov S.M., Improvability of assembly systems II: improvability indicators and case study, Mathematical Problems in Engineering, 6, 4, pp. 359-393, (2000)
  • [10] Ching S., Meerkov S.M., Zhang L., Assembly systems with non-exponential machines: throughput and bottlenecks, Nonlinear Analysis: Theory, Methods & Applications, 69, 3, pp. 911-917, (2008)