Institutional Repository
Technical University of Crete
EN  |  EL

Search

Browse

My Space

Admission control and scheduling in simple series parallel networks

Yannis Phillis, Runtong Zhang

Simple record


URIhttp://purl.tuc.gr/dl/dias/C5488BDB-5ED2-4F5D-942E-465E9C4363CE-
Identifierhttps://doi.org/ 10.1109/91.919251-
Languageen-
Extent8 pagesen
TitleAdmission control and scheduling in simple series parallel networksen
CreatorYannis Phillisen
CreatorΦιλλης Ιωαννηςel
CreatorRuntong Zhang en
PublisherIEEEen
Content SummaryTwo outstanding problems of admission control and scheduling in networks with three and two workstations, respectively, are solved using fuzzy logic. Neither problem has been tackled up until now analytically, whereas the fuzzy approach provides computational solutions. In the first case, we have one workstation with two parallel ones. A reward is earned whenever the first stage accepts a customer and a holding cost is incurred by a customer in queue in the second stage. The class of customer to be next served by the first stage is dynamically selected so as to maximize an average benefit over an infinite horizon. In the second case, there are two parallel servers and three arrival processes generated by independent Poisson streams. Each server has its own queue and receives customers from its own arrival stream. A third arrival stream consists of customers with resource demand on both servers. Each customer pays a holding cost per unit time in the system. Again, the scheduling policy is specified which minimizes the average cost. The fuzzy models are new in this context and tackle computationally problems for which we have not analytical solutions en
Type of ItemPeer-Reviewed Journal Publicationen
Type of ItemΔημοσίευση σε Περιοδικό με Κριτέςel
Licensehttp://creativecommons.org/licenses/by/4.0/en
Date of Item2015-10-06-
Date of Publication2001-
Bibliographic CitationR. Zhang and Y. A. Phillis, "Admission control and scheduling in simple series parallel networks," IEEE Trans. on Fuzzy Sys., vol. 9, no. 2, pp. 307-314, 2001.doi : 10.1109/91.919251en

Services

Statistics