Abstract
We study a system with two single-server stations in series. There is an infinite buffer in front of the first station and no buffer between the two stations. The customers come in groups; the groups contain random numbers of customers and arrive according to a Poisson process. Assuming general service time distributions at the two stations, we derive the Laplace transform and the recursive formula for the moments of the total time spent in the tandem system (waiting time in the system) by an arbitrary customer. From the Laplace transform, we conclude that the optimal order of the servers for minimizing the waiting time in the system does not depend on the group size.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.