Abstract
In this paper, a supply chain (four-input three-stage queuing network) receives uniformly distributed orders from clients. An input order is represented by two stochastic variables, occurrence time and the quantity of items to be delivered. The objective of this work is to compute the minimum response time, and thus the average number of items (optimum capacity) that can be delivered with this response time. Performance measures such as average queue lengths, average response times, and average waiting times of the jobs in the supply chain, and in the equivalent single-server network are derived, plotted and discussed.
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.
