Admission control and scheduling in simple series parallel networks using fuzzy logic

Two outstanding problems of admission control and scheduling in networks wi th three and two workstations, respectively, are solved using fuzzy logic, Neither problem has been tackled up until now analytically, whereas the fuz zy approach provides computational solutions. In the first case, me have on e 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 q ueue in the second stage. The class of customer to be next served by the fi rst stage is dynamically selected so as to maximize an average benefit over an infinite horizon, In the second case, there are two parallel servers an d three arrival processes generated by independent Poisson streams, Each se rver has its own queue and receives customers from its own arrival stream. A third arrival stream consists of customers,vith resource demand on both s ervers, Each customer pays a holding cost per unit time in the system. Agai n, the scheduling policy is specified which minimizes the average cost. The fuzzy models are new in this context and tackle computationally problems f or which we have not analytical solutions.