An Algorithmic Solution to Two-Stage Transfer Lines with Possible Scrapping of Units

Jevaveerasingam Shanthikumar and C. C. Tien
Additional contact information
C. C. Tien: Syracuse University

Management Science, 1983, vol. 29, issue 9, 1069-1086

Abstract: An important aspect of the efficient design of an automatic transfer line is the ability to understand and predict the effects of the system parameters such as the size of the intermediate buffer storage space, the cycle times, failure times, repair times, and scrap rate, on the production rate of the transfer line. In this paper we develop an efficient algorithm to compute the production rate of a two-stage transfer line for different system parameters. The algorithm is developed assuming that the failure and repair times are geometrically distributed and that the units may be scrapped with a certain probability when the machine processing it fails. Using this algorithm, extensive numerical results are obtained. Based on these numerical results, the behavior of the transfer line is discussed and some interesting observations are reported which would be useful in the design of automatic transform lines.

Keywords: production/scheduling: automatic transfer lines; probability: Markov processes; reliability (search for similar items in EconPapers)
Date: 1983
References: Add references at CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.29.9.1069 (application/pdf)

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:inm:ormnsc:v:29:y:1983:i:9:p:1069-1086

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().