a decomposition method for assembly/disassembly systems with blocking and general distributions

A modelling methodology is presented for assembly/disassembly systems with general processing time distributions and finite buffers. the approach combines the distributions discretization and a decomposition technique to analyze large manufacturing systems in a reasonable computational time and with good accuracy. in the decomposition technique, the system is decomposed into two station subsystems and the processing time distributions of the virtual stations are iteratively modified to approximate the impact of the rest of the network, adding estimations of the blocking and starving distributions. to analyze each subsystem, the general processing time distributions are discretized by aggregation of the probability masses, and the subsystem is then analytically modeled using a discrete markov chain. we first show that this approach allows an accurate estimation of the subsystems cycle time distributions, which is crucial in the decomposition technique. using computational experiments, we show that our decomposition method leads to accurate performance evaluation for large manufacturing systems (relative error on the order of 1%) and that the fine distribution estimation indeed seems to bring an improvement. furthermore, we show on examples that, using decomposition, the cycle time distributions can be approximated reliably for large systems.