ESTIMATING THE THROUGHPUT OF A CYCLIC ASSEMBLY SYSTEM

被引:24
作者
DUENYAS, I
机构
[1] Department of Industrial and Operations Engineering, The University of Michigan, Ann Arbor, MN
关键词
Approximation theory - Electronic equipment manufacture - Estimation - Fabrication - Machinery - Mathematical models - Processing - Production - Queueing theory - Statistical methods;
D O I
10.1080/00207549408957007
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
We consider a production system consisting of several fabrication lines feeding an assembly station. The machines in the fabrication lines and at assembly are assumed to have general processing time distributions. Releases to the system are governed by the CONWIP protocol. We model this system as an assembly-like queue and develop approximations for the throughput of the system. Comparisons with simulations show that this approximation is robust over a wide range of conditions. Finally, we observe that throughput tends to be higher when machines with higher mean processing times and:or higher variances are in fabrication rather than assembly.
引用
收藏
页码:1403 / 1419
页数:17
相关论文
共 28 条
[1]  
Adan I., Van Der Wal J., Monotonicity of the throughput in single server production and assembly networks with respect to buffer sizes, Queueing Networks with Blocking, pp. 345-356, (1989)
[2]  
Ammar M.H., Modelling and Analysis of Unreliable Manufacturing Assembly Networks with Finite Storage, (1980)
[3]  
Ammar M.H., Gershwin S.B., Equivalence relations in queueing models of fork/join queueing networks with blocking, Performance Evaluation, 19, pp. 233-245, (1989)
[4]  
Bacelli F., Makowski A.M., Shwartz A., The fork-join queue and related systems with synchronization constraints: Stochastic ordering, approximations, and computable bounds, Advances in Applied Probahilty, 21, pp. 629-647, (1989)
[5]  
Baker K.R., Powell S.G., Pyke D.F., Buffered and unbuffered assembly systems with variable processing times, Journal of Manufacturing and Operations Management, 3, pp. 200-223, (1990)
[6]  
Baker K.R., Powell S.G., Pyke D.F., Optimal allocation of work in assembly systems, Management Sciences, 39, pp. 101-106, (1993)
[7]  
Bhat U.N., Finite capacity assembly-like queues, Queueing Systems: Theory and Applications, 1, pp. 85-102, (1986)
[8]  
Birge J.R., Dula J.H., Bounding separable recourse functions with limited distribution information, Annals of Operations Research, 30, pp. 277-298, (1991)
[9]  
Bonomi F., An approximate analysis for a class of assembly-like queues, Queueing Systems: Theory and Applications, 1, pp. 289-300, (1987)
[10]  
Buzen J.P., Computational algorithms for closed queueing networks with exponential servers, Communications of the ACM, 16, pp. 527-531, (1973)