Abstract
This paper deals with the problem of optimally designing a complex queueing system in presence of some constraints. The system is constituted by a set of M/M/1 queueing (sub-)systems, sharing the same scarce resources, but otherwise running independently. The objective is to minimize an inefficiency index, defined as the maximum expected line-penalty among the subsystems. The service rates are the decision variables. Different special problems, admitting the same general formulation, are illustrated.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
