Admission control and scheduling in simple series parallel networksAdmission control and scheduling in simple series parallel networks Peer-Reviewed Journal Publication Δημοσίευση σε Περιοδικό με Κριτές 2015-10-062001enTwo 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 http://creativecommons.org/licenses/by/4.0/IEEE Transactions on Fuzzy Systems29307-314 Yannis Phillis Φιλλης Ιωαννης Runtong Zhang IEEE