Abstract
Two models of M/G/1 queues with removable server and scheduling within generations are considered in this paper. The scheduling policy considered here is the shortest processing time; the control policies are the multiple vacations policy and N-control policy. The Laplace-Stieltjes transforms of the waiting time distribution, the mean cost rates and the optimal control policies are derived for these two models. Properties of the delayed busy cycle are used in our analysis.
Sign-in/Register to access full text options 
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.
