Abstract
In many queuing situations customers are served in order of arrival; yet if customers with shorter service times were served first, it is well known that the mean queuing time could be reduced considerably. In a comparison with the “optimal” shortest service-time rule, a simple queue discipline involving only two non-preemptive priority classes fares very well. Numerical results illustrate the practical effects of implementing this simple alternative to service in order of arrival in a variety of queuing situations.
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.
