Abstract
Two outstanding problems of admission control and scheduling in networks with three and two workstations respectively are solved using fuzzy logic. 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 the queue in the second stage. The class of customer to be served next 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 machines and three arrival processes generated by independent Poisson streams. Each machine has its own queue and receives parts from its own arrival stream. The third arrival stream consists of parts with resource demand on both machines. 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 problems that cannot be solved by analysis.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.