Please use this identifier to cite or link to this item: http://hdl.handle.net/11718/17301
Title: Semi-open queuing networks: a review of stochastic models, solution methods and new research areas
Authors: Roy, Debjit
Keywords: Semi-open queuing networks;Semaphore/match/synchronisation/fork-join queues;Stochastic models;Solution methods
Issue Date: 2016
Publisher: Taylor & Francis
Citation: Roy D. (2016). Semi-open queuing networks: A review of stochastic models, solution methods and new research areas. International Journal of Production Research, 54(6), 1735-1752.
Abstract: Capturing the waiting times (at an external queue) for a customer to access a movable resource is an important step towards measuring customer service and system performance in manufacturing, logistics, communication and health care systems. Such waiting time measures are typically used for sizing resource and buffer capacities, and thereby minimising customer waiting time probabilities. In this regard, semi-open queuing networks (SOQNs), which decouple the arriving customers/transactions from the network resources using a synchronisation station (also known as a semaphore queue), can potentially capture the customer/transaction waiting times/costs more precisely and provide a rich network modelling construct. Hence, modelling manufacturing or service systems using SOQNs is an important step towards measuring customer flow times (sojourn times) wherein the customer waiting times at an external queue are a critical component. In this paper, we present several stochastic models for manufacturing and service systems using SOQNs and also discuss the potential applications of SOQNs. We then review the solution methods for SOQNs and also compare the numerical accuracies for three promising methods. Finally, we include the potential research areas in SOQNs.
URI: http://hdl.handle.net/11718/17301
ISSN: 1366-588X
Appears in Collections:Journal Articles

Files in This Item:
There are no files associated with this item.


Items in IIMA Institutional Repository are protected by copyright, with all rights reserved, unless otherwise indicated.