Abstract
We study a repairable M∕M∕1∕N queueing system with multiple types of customers. The difference between customers’ types is defined by the offered rewards. Once customers are admitted to the system, they have the same service rate. We show that under the average reward criterion, all optimal (deterministic) stationary policies have the trunk reservation form. We then prove the uniqueness of the bias optimal policy.
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.
