Abstract
In this paper a control policy for an Erlangian arrival has been studied. Here, the server goes on vacation when the system becomes empty, returning to an operative state after a random idle period lapses, or the queue length becomes N, whichever is earlier. The expressions for various operational characteristics have been obtained. Numerical results have been computed and some of these are graphed. Graphical interpretation of linear cost structure has been discussed.
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.
