Improvable theory of assembly systems: Two component-one assembly machine case
Summary: Improvability theory for a simple assembly system consisting of two components and one assembly machine is developed. Both constrained and unconstrained formulations are addressed. In the constrained case, it is shown that the assembly is unimprovable with respect to workforce if each component machine is blocked as frequently as the assembly machine is starved for parts produced by this particular assembly machine. The system is unimprovable with respect to work-in-process if, roughly speaking, all buffers have equal average steady state occupancy. In the unconstrained improvability case, it is shown that the bottleneck machine can be identitied by analyzing the probabilities of the so-called manufacturing blockages and starvations. A generalization to \(n\) component -- one assembly machine system is also included.
- Improvability of assembly systems. I: Problem formulation and performance evaluation
- scientific article; zbMATH DE number 49279
- Improvability of assembly systems. II: Improvability indicators and case study
- scientific article; zbMATH DE number 912602
- Assembly systems with non-exponential machines: Throughput and bottlenecks
This page was built for publication: Improvable theory of assembly systems: Two component-one assembly machine case
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1352850)
