Basic Queueing - Formulation Previous Next
Both the interactive routine and the Excel template for queueing simulation assume that the queueing system has
  1. a single service facility,
  2. a small number of homogeneous servers (a maximum of 2 and 5, respectively, for the two routines), where each customer is served individually by the first available server,
  3. a queue that will hold any number of customers while they wait to begin service.
Therefore, both routines can be applied to the Littletown bank problem. The present plan for the Littletown bank is that arriving customers will receive service on a first-come-first-served basis. Consequently, this demo does not incorporate another option that is available with the interactive routine, namely, that some customers will receive priority over others in the order of service (based on dividing customers into a small number of "priority classes"). This option is described and illustrated in another demo called Simulating a Queueing System with Priorities.