Improvability theory for assembly systems: Two component—one assembly machine case

Kuo C.-T, Lim J.-T, S. M. Meerkov and E. Park

Mathematical Problems in Engineering, 1996, vol. 3, 1-77

Abstract:

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 identified by analyzing the probabilities of the so-called manufacturing blockages and starvations. A generalization to n component—one assembly machine system is also included.

Date: 1996
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/3/943276.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/3/943276.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:943276

DOI: 10.1155/S1024123X97000501

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().