Queueing theory.

12 passengers per minute arrive at the concourse of a busy airport according to a Poisson process. After arrival, passengers travel down various routes according to the probabilities on the diagram below. (Notice that the diagram was drawn in Simio for convenience, but this is not a SImio problem. It is a Jackson queue problem.) Assume processing times at each stage are from the exponential distribution. Assume all travel times between nodes are zero.The tasks, and the order in which they are performed, are as follows.

As you analyze this system, make sure that 100% of your entities make it through the system. The number of servers at each node and the service times per server are given this table:

Station No. of Mean service time Servers (min) per server 10 1 5 1 Kiosk Check In Agent Check In Baggage Weigh In Baggage Security ID Check 2. 2 2 1/2 1/2 1/12 1/12 1/3 Initial TSA Screen 2 Detailed TSA Screen 1 3/4 2/3 KioskCheckin 1 DetailedTSAScreen 1/12 1/4 1 1 DEL ArriveAtAirport 11/12 1/4 EaggageWeighin BagageSecurity IDCheck InitialTSAScreen Gate 1/3 AgentCheckin 3/4 Pitfall: Be clear on your distinction between times and rates. You need to use the stability condition 2