Please use this identifier to cite or link to this item: http://hdl.handle.net/11718/19459
Title: A nested semi-open queuing network model for analyzing dine-in restaurant performance
Authors: Roy, Debjit
Bandyopadhyay, Arindam
Banerjee, Pritam
Keywords: Dine-in restaurant;Nested queues;Semi-open queuing networks;Throughput time
Issue Date: 2016
Publisher: Elsevier Ltd
Citation: Roy D., Bandyopadhyay A., Banerjee P. (2016). A nested semi-open queuing network model for analyzing dine-in restaurant performance. Computers and Operations Research, 65, 29-41.
Abstract: Low customer wait times at restaurants can improve both customer walk-ins and satisfaction levels. To manage customer wait times, the operators need a thorough understanding of how restaurant design parameters such as the layout, the number of tables, the number of chefs and other critical kitchen resources affect customer throughput times. In this paper, we present a nested two-level semi-open queuing network model for evaluating the throughput time performance of a dine-in restaurant. We also develop a novel two-phase solution approach to obtain the steady state network performance measures. With throughput time approximations in the inner-level queuing network, the outer-level semi-open queuing network is reduced to an M/G/C queue. The model is extremely useful to identify the bottleneck resources in the system and size system resources for superior customer dine-in experience. To develop the analytical model, we use the layout and design parameters from a well-known restaurant chain in western India. We execute detailed simulation runs to validate the analytical model and test the efficacy of the solution approach.
URI: http://hdl.handle.net/11718/19459
Appears in Collections:Journal Articles

Files in This Item:
File Description SizeFormat 
A nested semi-open queuing network model for analyzing_Debjit Roy_Computers and Operations Research_2016.pdf
  Restricted Access
924.61 kBAdobe PDFView/Open Request a copy


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