--%>

Simulation with Arena

An office of state license bureau has two types of arrivals. Individuals interested in purchasing new plates are characterized to have inter-arrival times distributed as EXPO(6.8) and service times as TRIA(808, 13.7, 15.2); all times are in minutes. Individuals who want to renew or apply for a new driver’s license have inter-arrival times distributed as EXPO(8.7) and service times as TRIA(16.7, 20.5, 29.2). The office has two lines, one for each customer type. The office has five clerks: two devoted to plates (Mary and Kathy), two devoted to licenses (Sue and Jean), and the team leader (Neil) who can serve both customer types. Neil will serve the customer who has been waiting the longest. Assume that all clerks are available all the time for the eight-hour day. Note that when entities from the front of multiple FIFO queues (corresponding to multiple Process modules) try to seize the same Resource, the logic to select which entity “wins” is as though all the queues were merged together into a single FIFO queue. Observe the system or cycle time for both customer types. The office described in exercise above, is considering cross-training Kathy so she can serve both customer types. Modify the model to represent this, and see what effect this has on system time by customer.

   Related Questions in Mathematics

  • Q : Elasticity of Demand For the demand

    For the demand function D(p)=410-0.2p(^2), find the maximum revenue.

  • Q : How to get calculus homework done from

    How to get calculus homework done from tutor

  • Q : What is Non-Logical Vocabulary

    Non-Logical Vocabulary: 1. Predicates, called also relation symbols, each with its associated arity. For our needs, we may assume that the number of predicates is finite. But this is not essential. We can have an infinite list of predicates, P

  • Q : Graph Theory is the n-Dimensional Qn

    is the n-Dimensional Qn Hamiltonian? Prove tour answer

  • Q : Bolzano-Weierstrass property The

    The Bolzano-Weierstrass property does not hold in C[0, ¶] for the infinite set A ={sinnx:n<N} : A is infinite; Show that has no “ limit points”.

  • Q : Linear programming model of a Cabinet

    A cabinet company produces cabinets used in mobile and motor homes. Cabinets produced for motor homes are smaller and made from less expensive materials than those for mobile homes. The home office in Dayton Ohio has just distributed to its individual manufacturing ce

  • Q : Profit-loss based problems A leather

    A leather wholesaler supplies leather to shoe companies. The manufacturing quantity requirements of leather differ depending upon the amount of leather ordered by the shoe companies to him. Due to the volatility in orders, he is unable to precisely predict what will b

  • Q : Simulation with Arena An office of

    An office of state license bureau has two types of arrivals. Individuals interested in purchasing new plates are characterized to have inter-arrival times distributed as EXPO(6.8) and service times as TRIA(808, 13.7, 15.2); all times are in minutes. Individuals who want to renew or apply for a new d

  • Q : Define Big-O notation Big-O notation :

    Big-O notation: If f(n) and g(n) are functions of a natural number n, we write f(n) is O(g(n)) and we say f is big-O of g if there is a constant C (independent of n) such that f

  • Q : State Fermat algorithm The basic Fermat

    The basic Fermat algorithm is as follows: Assume that n is an odd positive integer. Set c = [√n] (`ceiling of √n '). Then we consider in turn the numbers c2 - n; (c+1)2 - n; (c+2)2 - n..... until a perfect square is found. If th