Performance analysis of assembly/disassembly systems with unreliable machines and random processing times
Authors:
- 1 January 1998
- journal article
- research article
- Published by Taylor & Francis in IIE Transactions
- Vol. 30 (1) , 41-53
Abstract
This paper presents an efficient method to evaluate performance of tree-structured assembly/disassembly (AD) systems with finite buffer capacity. The times to failure, the times to repair, and the processing times are assumed to be exponentially distributed. The method is based on an extension of a decomposition method originally applied to performance evaluation of transfer lines. The method decomposes a K-machine tree-structured AD system to a system of K - 1 two-machine lines and then finds the processing rates, failure rates and repair rates of the decomposed system that make performance of the two systems close to each other. To determine those rates of the decomposed system, we derive 6(K - 1) equations based on interruption of flow, resumption of flow, and flow rate-idle time relations, and suggest two methods, which use the equations in different ways. Results from computational experiments show that the suggested decomposition methods give good estimates in a short time.Keywords
This publication has 18 references indexed in Scilit:
- Analysis of behaviour of an unreliablen-stage transfer line with (n− 1) inter-stage storage buffersInternational Journal of Production Research, 1993
- Manufacturing flow line systems: a review of models and analytical resultsQueueing Systems, 1992
- The Analysis of a Production Line with Unreliable Machines and Random Processing TimesIIE Transactions, 1992
- A decomposition procedure for the analysis of a closed fork/join queueing systemIEEE Transactions on Computers, 1991
- The fork-join queue and related systems with synchronization constraints: stochastic ordering and computable boundsAdvances in Applied Probability, 1989
- Acyclic fork-join queuing networksJournal of the ACM, 1989
- An Efficient Algorithm for Analysis of Transfer Lines With Unreliable Machines and Finite BuffersIIE Transactions, 1988
- A Decomposition Method For The Approximate Evaluation Of Capacitated Transfer Lines With Unreliable Machines And Random Processing TimesIIE Transactions, 1987
- Multi-server assembly queuesJournal of Applied Probability, 1974
- Assembly-like queuesJournal of Applied Probability, 1973