--%>
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 : Problem on Fermats method A public key

    A public key for RSA is published as n = 17947 and a = 3. (i) Use Fermat’s method to factor n. (ii) Check that this defines a valid system and find the private key X.

    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

    		•
  • Q : Properties for polynomial Specify the

    Specify the important properties for the polynomial.

    		•
  • Q : Law of iterated expectations for

     Prove the law of iterated expectations for continuous random variables. 2. Prove that the bounds in Chebyshev's theorem cannot be improved upon. I.e., provide a distribution that satisfies the bounds exactly for k ≥1, show that it satisfies the bounds exactly, and draw its PDF. T

    		•
  • Q : Problem on Datalog for defining

    The focus is on  the use of Datalog for defining properties  and queries on graphs. (a) Assume that P is some property of graphs  definable in the Datalog. Show that P is preserved beneath extensions  and homomo

    		•
  • 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 : Elasticity of Demand For the demand

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

    		•
  • Q : Properties of a group How can we say

    How can we say that the pair (G, o) is a group. Explain the properties which proof it.

    		•
  • Q : First-order formulas over the

    Consider the unary relational symbols P and L, and the binary relational symbol On, where P(a) and I(a) encode that a is apoint and a (sraight) line in the 2-dimensional space, respectively, while On(a,b) encodes  that a is a point, b is a line, and o lies on b.

    		•
  • Q : Maths A cricketer cn throw a ball to a

    A cricketer cn throw a ball to a max horizontl distnce of 100m. If he throws d same ball vertically upwards then the max height upto which he can throw is????

    		•