<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/70065A04-05D2-44F0-B877-F831ADCD8FE8"><efrbr-work:titleOfTheWork>Fuzzy assignment of customers for a parallel queueing system with two heterogeneous servers</efrbr-work:titleOfTheWork></efrbr-work:work><efrbr-expression:expression identifier="http://purl.tuc.gr/dl/dias/70065A04-05D2-44F0-B877-F831ADCD8FE8"><efrbr-expression:titleOfTheExpression>Fuzzy assignment of customers for a parallel queueing system with two heterogeneous servers</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">2001</efrbr-expression:dateOfExpression><efrbr-expression:languageOfExpression vocabulary="iso639-1">en</efrbr-expression:languageOfExpression><efrbr-expression:summarizationOfContent>We consider a queueing system with two parallel heterogeneous servers. Each exponential server has its own queue and customers arrive at each queue according to independent Poisson processes. When a customer arrives at queue 1, the customer can be transferred to queue 2 by paying an assignment cost. Each customer in queue pays a holding cost per unit time. The objective is to dynamically determine the optimal assignment policy, based on the state of the system, so as to minimize the average cost. In this paper, a novel approach is presented using fuzzy control to solve the problem. Simulation shows that the approach is efficient and promisin</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">3-4</efrbr-expression:note><efrbr-expression:note type="journal number">11</efrbr-expression:note><efrbr-expression:note type="page range">163-169</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="8D7CC24E-6748-4A90-9A20-6359F6C0A259"><efrbr-person:nameOfPerson vocabulary="">
             Zhang  Runtong
         </efrbr-person:nameOfPerson></efrbr-person:person><efrbr-concept:concept identifier="http://id.loc.gov/authorities/subjects/sh85040850"><efrbr-concept:termForTheConcept>
            Economic theory
            Political economy
            economics
            economic theory
            political economy
         </efrbr-concept:termForTheConcept></efrbr-concept:concept></efrbr:entities><efrbr:relationships><efrbr-structure:structureRelations><efrbr-structure:realizedThrough sourceEntity="work" sourceURI="http://purl.tuc.gr/dl/dias/70065A04-05D2-44F0-B877-F831ADCD8FE8" targetEntity="expression" targetURI="http://purl.tuc.gr/dl/dias/70065A04-05D2-44F0-B877-F831ADCD8FE8"/></efrbr-structure:structureRelations><efrbr-responsible:responsibleRelations><efrbr-responsible:createdBy sourceEntity="work" sourceURI="http://purl.tuc.gr/dl/dias/70065A04-05D2-44F0-B877-F831ADCD8FE8" targetEntity="person" targetURI="http://users.isc.tuc.gr/~yphillis"/><efrbr-responsible:realizedBy sourceEntity="expression" sourceURI="http://purl.tuc.gr/dl/dias/70065A04-05D2-44F0-B877-F831ADCD8FE8" targetEntity="person" targetURI="http://users.isc.tuc.gr/~yphillis" role="author"/><efrbr-responsible:realizedBy sourceEntity="expression" sourceURI="http://purl.tuc.gr/dl/dias/70065A04-05D2-44F0-B877-F831ADCD8FE8" targetEntity="person" targetURI="8D7CC24E-6748-4A90-9A20-6359F6C0A259" role="author"/></efrbr-responsible:responsibleRelations><efrbr-subject:subjectRelations><efrbr-subject:hasSubject sourceEntity="work" sourceURI="http://purl.tuc.gr/dl/dias/70065A04-05D2-44F0-B877-F831ADCD8FE8" targetEntity="concept" targetURI="http://id.loc.gov/authorities/subjects/sh85040850"/></efrbr-subject:subjectRelations><efrbr-other:otherRelations/></efrbr:relationships></efrbr:recordSet>