Abstract
A controllable tandem queueing system consists of two nodes in tandem of the type $$M/M/n_i$$ and a controller. Customers arrive to the controller, who allocates them between the nodes. After service completion at node 2 the controller can allocate the customer waiting at node 1 to node 2. With probability $$p$$ after a service completion at node 1 a failure occurs. In this case the customer from node 1 joins node 2. With complement probability $$1-p$$ the service completion at node 1 is successful. For the given cost structure we formulate an optimal allocation problem to minimize the long-run average cost per unit of time. Using dynamic-programming approach we show the existence of thresholds which divides the state-space into two contiguous regions where the optimal decision is to allocate the customers to node 1 or to node 2. Some monotonicity properties of the dynamic-programming value function are established.
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.
