Abstract
Tandem queues with finite buffers have been widely discussed as basic models of communication and manufacturing systems. Because of the difficulties in analysis, many researchers discuss the approximate values and bounds for the expected cycle times. Most of them, however, use a decomposition approach with first and second moments of service time distributions, or assume only two or three stations and/or exponential service. In this paper, we consider finite tandem queues with production or communication blocking and general service time distributions. We utilize the distribution functions of service times, not only with their first and second moments, to give the upper and lower bounds for the expected cycle times. Numerical examples show good performance in tandem queues with the least buffer sizes for production and communication blocking.
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.
