Abstract
Finite buffer, single server queues with general service times along with state dependent queues were shown to be robust with respect to the general flow processes in transportation and material handling systems (MHS). This paper examines the integration of multi-server and state dependent queues and the robustness properties in these queueing network models. It is also shown that the topological arrangements problem (TAP) in a finite queueing network is NP-Hard. Extensive computational results are included to test the properties of these network models to changes in service times, buffers, and other MHS network parameters.
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.
