--%>
Assignment Help - homework help

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 : Set Theory & Model of a Boolean Algebra

    II. Prove that Set Theory is a Model of a Boolean Algebra The three Boolean operations of Set Theory are the three set operations of union (U), intersection (upside down U), and complement ~.  Addition is set

    		•
  • Q : Numerical Analysis Hi, I was wondering

    Hi, I was wondering if there is anyone who can perform numerical analysis and write a code when required. Thanks

    		•
  • Q : What is the definition of a group Group

    Group: Let G be a set. When we say that o is a binary operation on G, we mean that o is a function from GxG into G. Informally, o takes pairs of elements of G as input and produces single elements of G as output. Examples are the operations + and x of

    		•
  • Q : Explain a rigorous theory for Brownian

    Explain a rigorous theory for Brownian motion developed by Wiener Norbert.

    		•
  • Q : How to calculate area of pyramid

    Calculate area of pyramid, prove equation?

    		•
  • Q : Theorem-G satis es the right and left

    Let G be a group. (i) G satis es the right and left cancellation laws; that is, if a; b; x ≡ G, then ax = bx and xa = xb each imply that a = b. (ii) If g ≡ G, then (g-1)

    		•
  • 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 : Problem on Maple (a) Solve the

    (a) Solve the following  by: (i) First reducing the system of first order differentiat equations to a second order differential equation. (ii) Decoupling the following linear system of equa

    		•
  • Q : Abstract Algebra let a, b, c, d be

    let a, b, c, d be integers. Prove the following statements: (a) if a|b and b|c. (b) if a|b and ac|bd. (c) if d|a and d|b then d|(xa+yb) for any x, y EZ

    		•
  • Q : State Measuring complexity Measuring

    Measuring complexity: Many algorithms have an integer n, or two integers m and n, as input - e.g., addition, multiplication, exponentiation, factorisation and primality testing. When we want to describe or analyse the `easiness' or `hardness' of the a

    		•