<efrbr:recordSet xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:efrbr="http://vfrbr.info/efrbr/1.1" xmlns:efrbr-work="http://vfrbr.info/efrbr/1.1/work" xmlns:efrbr-expression="http://vfrbr.info/efrbr/1.1/expression" xmlns:efrbr-manifestation="http://vfrbr.info/efrbr/1.1/manifestation" xmlns:efrbr-person="http://vfrbr.info/efrbr/1.1/person" xmlns:efrbr-corporateBody="http://vfrbr.info/efrbr/1.1/corporateBody" xmlns:efrbr-concept="http://vfrbr.info/efrbr/1.1/concept" xmlns:efrbr-structure="http://vfrbr.info/efrbr/1.1/structure" xmlns:efrbr-responsible="http://vfrbr.info/efrbr/1.1/responsible" xmlns:efrbr-subject="http://vfrbr.info/efrbr/1.1/subject" xmlns:efrbr-other="http://vfrbr.info/efrbr/1.1/other" xsi:schemaLocation="http://vfrbr.info/efrbr/1.1 http://vfrbr.info/schemas/1.1/efrbr.xsd"><efrbr:entities><efrbr-work:work identifier="http://purl.tuc.gr/dl/dias/36A4E2EA-319F-41A8-8EDC-FF1FC38675DC"><efrbr-work:titleOfTheWork>A serial finite unreliable queue model for production lines</efrbr-work:titleOfTheWork></efrbr-work:work><efrbr-expression:expression identifier="http://purl.tuc.gr/dl/dias/36A4E2EA-319F-41A8-8EDC-FF1FC38675DC"><efrbr-expression:titleOfTheExpression>A serial finite unreliable queue model for production lines</efrbr-expression:titleOfTheExpression><efrbr-expression:formOfExpression vocabulary="DIAS:TYPES">
            Πλήρης Δημοσίευση σε Συνέδριο
            Conference Full Paper
         </efrbr-expression:formOfExpression><efrbr-expression:dateOfExpression type="issued">2015-11-07</efrbr-expression:dateOfExpression><efrbr-expression:dateOfExpression type="published">1992</efrbr-expression:dateOfExpression><efrbr-expression:languageOfExpression vocabulary="iso639-1">en</efrbr-expression:languageOfExpression><efrbr-expression:summarizationOfContent>Serial production lines in practice behave as queuing networks of the tandem type with finite queue length and unreliable servers. The authors present a model for such a system utilizing simulation and analysis. Exponential service times are approximated by sums of deterministic variables using a simple probabilistic technique. The model observes a limited number of events which are sufficient to determine system performance and mean buffer levels. By appropriately reducing the rates of starved and blocked machines and using analysis to compute the times of next event at each machine and buffer, piece-by-piece computations are avoided. It turns out that this approximate model is highly accurate and faster by a factor of 3 or more when compared to conventional piece-by-piece simulators</efrbr-expression:summarizationOfContent><efrbr-expression:useRestrictionsOnTheExpression type="creative-commons">http://creativecommons.org/licenses/by/4.0/</efrbr-expression:useRestrictionsOnTheExpression><efrbr-expression:note type="page range">1659 - 1664</efrbr-expression:note><efrbr-expression:note type="conference name">31st IEEE Conference on Decision and Control</efrbr-expression:note></efrbr-expression:expression><efrbr-person:person identifier="http://users.isc.tuc.gr/~vkouikoglou"><efrbr-person:nameOfPerson vocabulary="TUC:LDAP">
            Kouikoglou Vasilis
            Κουϊκογλου Βασιλης
         </efrbr-person:nameOfPerson></efrbr-person:person><efrbr-person:person identifier="http://users.isc.tuc.gr/~yphillis"><efrbr-person:nameOfPerson vocabulary="TUC:LDAP">
            Yannis Phillis
            Φιλλης Ιωαννης
         </efrbr-person:nameOfPerson></efrbr-person:person><efrbr-corporateBody:corporateBody identifier="http://www.ieee.org/index.html"><efrbr-corporateBody:nameOfTheCorporateBody vocabulary="S/R:PUBLISHERS">
            Institute of Electrical and Electronics Engineers
         </efrbr-corporateBody:nameOfTheCorporateBody></efrbr-corporateBody:corporateBody></efrbr:entities><efrbr:relationships><efrbr-structure:structureRelations><efrbr-structure:realizedThrough sourceEntity="work" targetEntity="expression" sourceURI="http://purl.tuc.gr/dl/dias/36A4E2EA-319F-41A8-8EDC-FF1FC38675DC" targetURI="http://purl.tuc.gr/dl/dias/36A4E2EA-319F-41A8-8EDC-FF1FC38675DC"/></efrbr-structure:structureRelations><efrbr-responsible:responsibleRelations><efrbr-responsible:createdBy sourceEntity="work" targetEntity="person" sourceURI="http://purl.tuc.gr/dl/dias/36A4E2EA-319F-41A8-8EDC-FF1FC38675DC" targetURI="http://users.isc.tuc.gr/~vkouikoglou"/><efrbr-responsible:realizedBy sourceEntity="expression" role="author" targetEntity="person" sourceURI="http://purl.tuc.gr/dl/dias/36A4E2EA-319F-41A8-8EDC-FF1FC38675DC" targetURI="http://users.isc.tuc.gr/~vkouikoglou"/><efrbr-responsible:realizedBy sourceEntity="expression" role="author" targetEntity="person" sourceURI="http://purl.tuc.gr/dl/dias/36A4E2EA-319F-41A8-8EDC-FF1FC38675DC" targetURI="http://users.isc.tuc.gr/~yphillis"/><efrbr-responsible:realizedBy sourceEntity="expression" role="publisher" targetEntity="person" sourceURI="http://purl.tuc.gr/dl/dias/36A4E2EA-319F-41A8-8EDC-FF1FC38675DC" targetURI="http://www.ieee.org/index.html"/></efrbr-responsible:responsibleRelations><efrbr-subject:subjectRelations/><efrbr-other:otherRelations/></efrbr:relationships></efrbr:recordSet>