<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/D8AE0E48-3FAF-4F43-9D4A-DB463F8DB359"><efrbr-work:titleOfTheWork>Fuzzy control of two-station queueing networks with two types of customers</efrbr-work:titleOfTheWork></efrbr-work:work><efrbr-expression:expression identifier="http://purl.tuc.gr/dl/dias/D8AE0E48-3FAF-4F43-9D4A-DB463F8DB359"><efrbr-expression:titleOfTheExpression>Fuzzy control of two-station queueing networks with two types of customers</efrbr-expression:titleOfTheExpression><efrbr-expression:formOfExpression vocabulary="DIAS:TYPES">
            Peer-Reviewed Journal Publication
            Δημοσίευση σε Περιοδικό με Κριτές
         </efrbr-expression:formOfExpression><efrbr-expression:dateOfExpression type="issued">2015-10-06</efrbr-expression:dateOfExpression><efrbr-expression:dateOfExpression type="published">2000</efrbr-expression:dateOfExpression><efrbr-expression:languageOfExpression vocabulary="iso639-1">en</efrbr-expression:languageOfExpression><efrbr-expression:summarizationOfContent>This paper considers tandem two-station queueing networks with two types of customers. Firstly, we examine a model where type 1 customers visit station 1 only while type 2 customers visit both stations in sequence. Each station has a single server and unlimited buffer capacity. The service rate in station 1 is variable. The cost depends on the queue length and selected rate. The objective is to dynamically route customers of both types to station 1 and choose the service rate, based on the state of the system, so as to minimize the average cost over an infinite horizon. Secondly, we examine a system in which station 1 has one server, station 2 two servers, and the buffers have infinite capacity. Two types of customers are first served at station 1 and subsequently proceed to the buffer of a given server according to type in station 2. A reward is earned whenever station 1 accepts a customer and a holding cost is incurred by a customer in buffer at station 2. The objective is to dynamically select the type of customer to be next served at station 1 so as to maximize the average benefit. Customer routing, service rate selection, and flow control are considered simultaneously. We use fuzzy control to solve these complex problems. Simulation shows that the approach is efficient.</efrbr-expression:summarizationOfContent><efrbr-expression:useRestrictionsOnTheExpression type="creative-commons">http://creativecommons.org/licenses/by/4.0/</efrbr-expression:useRestrictionsOnTheExpression><efrbr-expression:note type="journal name">Journal of Intelligent and Fuzzy Systems</efrbr-expression:note><efrbr-expression:note type="journal volume">1</efrbr-expression:note><efrbr-expression:note type="journal number">8</efrbr-expression:note><efrbr-expression:note type="page range">27 - 42 </efrbr-expression:note></efrbr-expression:expression><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-person:person identifier="4AEBE174-A216-46DB-AB23-5B72FCBF1982"><efrbr-person:nameOfPerson vocabulary="">
            Runtong Zhang
         </efrbr-person:nameOfPerson></efrbr-person:person><efrbr-corporateBody:corporateBody identifier="http://www.acm.org/"><efrbr-corporateBody:nameOfTheCorporateBody vocabulary="S/R:PUBLISHERS">
            Association for Computing Machinery
         </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/D8AE0E48-3FAF-4F43-9D4A-DB463F8DB359" targetURI="http://purl.tuc.gr/dl/dias/D8AE0E48-3FAF-4F43-9D4A-DB463F8DB359"/></efrbr-structure:structureRelations><efrbr-responsible:responsibleRelations><efrbr-responsible:createdBy sourceEntity="work" targetEntity="person" sourceURI="http://purl.tuc.gr/dl/dias/D8AE0E48-3FAF-4F43-9D4A-DB463F8DB359" targetURI="http://users.isc.tuc.gr/~yphillis"/><efrbr-responsible:realizedBy sourceEntity="expression" role="author" targetEntity="person" sourceURI="http://purl.tuc.gr/dl/dias/D8AE0E48-3FAF-4F43-9D4A-DB463F8DB359" targetURI="http://users.isc.tuc.gr/~yphillis"/><efrbr-responsible:realizedBy sourceEntity="expression" role="author" targetEntity="person" sourceURI="http://purl.tuc.gr/dl/dias/D8AE0E48-3FAF-4F43-9D4A-DB463F8DB359" targetURI="4AEBE174-A216-46DB-AB23-5B72FCBF1982"/><efrbr-responsible:realizedBy sourceEntity="expression" role="publisher" targetEntity="person" sourceURI="http://purl.tuc.gr/dl/dias/D8AE0E48-3FAF-4F43-9D4A-DB463F8DB359" targetURI="http://www.acm.org/"/></efrbr-responsible:responsibleRelations><efrbr-subject:subjectRelations/><efrbr-other:otherRelations/></efrbr:relationships></efrbr:recordSet>