$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.

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

Servers

Mean service time

$($min$)$ per server

Kiosk Check In $101$

Agent Check In $51$

Baggage Weigh In $21/2$

Baggage Security $21/2$

ID Check $21/12$

Initial TSA Screen $21/12$

Detailed TSA Screen $11/312$

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.

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

Servers

Mean service time

$($min$)$ per server

Kiosk Check In $101$

Agent Check In $51$

Baggage Weigh In $21/2$

Baggage Security $21/2$

ID Check $21/12$

Initial TSA Screen $21/12$

Detailed TSA Screen $11/312$

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.

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

Servers

Mean service time

$($min$)$ per server

Kiosk Check In $101$

Agent Check In $51$

Baggage Weigh In $21/2$

Baggage Security $21/2$

ID Check $21/12$

Initial TSA Screen $21/12$

Detailed TSA Screen $11/312$

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.

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

Servers

Mean service time

$($min$)$ per server

Kiosk Check In $101$

Agent Check In $51$

Baggage Weigh In $21/2$

Baggage Security $21/2$

ID Check $21/12$

Initial TSA Screen $21/12$

Detailed TSA Screen $11/3$