Abstract
ANALYSIS OF THE CONTROL OF QUEUES WITH SHORTEST PROCESSING TIME SE:RVICE DISCIPLINE J eyaveerasingam George Shanthikumar Unil'ersity of Toronto (Received November 12, 1979; Revised July I, 1980) We analyze two models of controlled M/G/ 1 queues with shortest processing time service disciplifle and removable server. The control policies considered here are th·~ server vacation policy of Levy and Yechiali and the N· control policy of Heyman. The Laplace-Stieltjes transfonns of the waiting time distributions, the mean cost ra1:es and the optimal control policies are derived for these two models. Properties of level crossings of regenerative processes and delayed busy cycles 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.
