Linking equations for the analysis of a serial automated workstation system Public Deposited

http://ir.library.oregonstate.edu/concern/graduate_thesis_or_dissertations/7s75dg804

Descriptions

Attribute NameValues
Creator
Abstract or Summary
  • In this research, an analytical model for analyzing a production line consisting of a series of automated workstations with infinite buffers is developed. Automated workstations are assumed to have deterministic processing times, and independent exponentially distributed operating time between failures and repair times. The analytical model starts with existing results from a Markov chain model of two automated workstations in series, where analytical expressions are developed for the average number of jobs in the second workstation and its queue. This research focuses on the development of a set of linking equations that can be used to analyze larger systems using a two workstation decomposition approach. These linking equations utilize probabilities computed in the two-workstation Markov chain model to compute workstation parameters for a single workstation such that the first two moments of the inter-departure process from the two-workstation system and the single workstation are the same. Simulations of a number of different 3-workstation and 10-workstation systems were carried out employing a range of workstation utilizations and processing time coefficients of variation. The results from these simulations were compared with those calculated with the analytical model and various two-parameter GI/G/1 approximations and linking equations present in the literature. The analytical model resulted in an average absolute percentage difference of less than 5% in the systems studied, and performed much better than general two parameter G/G/1 approximations. The analytical model was also robust in ranking the queues in the order of the average number of jobs present in the queues.
Resource Type
Date Available
Date Copyright
Date Issued
Degree Level
Degree Name
Degree Field
Degree Grantor
Commencement Year
Advisor
Academic Affiliation
Non-Academic Affiliation
Subject
Rights Statement
Peer Reviewed
Language
Digitization Specifications
  • File scanned at 300 ppi (Monochrome, 256 Grayscale) using Capture Perfect 3.0.82 on a Canon DR-9080C in PDF format. CVista PdfCompressor 4.0 was used for pdf compression and textual OCR.
Replaces
Additional Information
  • description.provenance : Submitted by Kirsten Clark (kcscannerosu@gmail.com) on 2012-08-10T19:57:40Z No. of bitstreams: 1 NagarajanRaghavendran2004.pdf: 3562885 bytes, checksum: fa4d30a45871ed7766415347fe31407a (MD5)
  • description.provenance : Approved for entry into archive by Patricia Black(patricia.black@oregonstate.edu) on 2012-08-10T20:46:39Z (GMT) No. of bitstreams: 1 NagarajanRaghavendran2004.pdf: 3562885 bytes, checksum: fa4d30a45871ed7766415347fe31407a (MD5)
  • description.provenance : Made available in DSpace on 2012-08-10T20:50:14Z (GMT). No. of bitstreams: 1 NagarajanRaghavendran2004.pdf: 3562885 bytes, checksum: fa4d30a45871ed7766415347fe31407a (MD5) Previous issue date: 2003-12-08
  • description.provenance : Approved for entry into archive by Patricia Black(patricia.black@oregonstate.edu) on 2012-08-10T20:50:13Z (GMT) No. of bitstreams: 1 NagarajanRaghavendran2004.pdf: 3562885 bytes, checksum: fa4d30a45871ed7766415347fe31407a (MD5)

Relationships

In Administrative Set:
Last modified: 08/20/2017

Downloadable Content

Download PDF
Citations:

EndNote | Zotero | Mendeley

Items