Production variability in manufacturing systems: Bernoulli reliability case
dc.contributor.author | Li, Jingshan | en_US |
dc.contributor.author | Meerkov, Semyon M. | en_US |
dc.date.accessioned | 2006-09-11T14:33:42Z | |
dc.date.available | 2006-09-11T14:33:42Z | |
dc.date.issued | 2000-01 | en_US |
dc.identifier.citation | Li, Jingshan; Meerkov, Semyon M.; (2000). "Production variability in manufacturing systems: Bernoulli reliability case." Annals of Operations Research 93 (1-4): 299-324. <http://hdl.handle.net/2027.42/44290> | en_US |
dc.identifier.issn | 0254-5330 | en_US |
dc.identifier.issn | 1572-9338 | en_US |
dc.identifier.uri | https://hdl.handle.net/2027.42/44290 | |
dc.description.abstract | The problem of production variability in serial manufacturing lines with unreliable machines is addressed. Bernoulli statistics of machine reliability are assumed. Three problems are considered: the problem of production variance, the problem of constant demand satisfaction, and the problem of random demand satisfaction generated by another (unreliable) production line. For all three problems, bounds on the respective variability measures are derived. These bounds show that long lines smooth out the production and reduce the variability. More precisely, these bounds state that the production variability of a line with many machines is smaller than that of a single machine system with production volume and reliability characteristics similar to those of the longer line. Since all the variability measures for a single machine line can be calculated relatively easily, these bounds provide analytical tools for analysis and design of serial production lines from the point of view of the customer demand satisfaction. | en_US |
dc.format.extent | 221752 bytes | |
dc.format.extent | 3115 bytes | |
dc.format.mimetype | application/pdf | |
dc.format.mimetype | text/plain | |
dc.language.iso | en_US | |
dc.publisher | Kluwer Academic Publishers; Springer Science+Business Media | en_US |
dc.subject.other | Economics / Management Science | en_US |
dc.subject.other | Theory of Computation | en_US |
dc.subject.other | Combinatorics | en_US |
dc.subject.other | Operation Research/Decision Theory | en_US |
dc.subject.other | Production Systems | en_US |
dc.subject.other | Unreliable Machines | en_US |
dc.subject.other | Production Variability | en_US |
dc.title | Production variability in manufacturing systems: Bernoulli reliability case | en_US |
dc.type | Article | en_US |
dc.subject.hlbsecondlevel | Management | en_US |
dc.subject.hlbsecondlevel | Industrial and Operations Engineering | en_US |
dc.subject.hlbsecondlevel | Economics | en_US |
dc.subject.hlbtoplevel | Engineering | en_US |
dc.subject.hlbtoplevel | Business | en_US |
dc.description.peerreviewed | Peer Reviewed | en_US |
dc.contributor.affiliationum | Department of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor, MI, 48109‐2122, USA | en_US |
dc.contributor.affiliationum | Department of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor, MI, 48109‐2122, USA | en_US |
dc.contributor.affiliationumcampus | Ann Arbor | en_US |
dc.description.bitstreamurl | http://deepblue.lib.umich.edu/bitstream/2027.42/44290/1/10479_2004_Article_326034.pdf | en_US |
dc.identifier.doi | http://dx.doi.org/10.1023/A:1018928007956 | en_US |
dc.identifier.source | Annals of Operations Research | en_US |
dc.owningcollname | Interdisciplinary and Peer-Reviewed |
Files in this item
Remediation of Harmful Language
The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.
Accessibility
If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.