The Hong Kong Polytechnic University · FACULTY OF ECONOMICS

AAE5110 Chap.3 Airport Operations and Queue Decisions

- one subject, every graph, every model, every mark
8 Chapters4-page Bible
Our own words - no uploaded lecturer files
Updated for this semester
Chapter 3 of 7 · AAE5110

Airport Operations and Queue Decisions

Airports are connected queues

Airport processes are linked queues in which random arrivals meet service capacity. This chapter converts between service time and service rate, tests stability, and separates queue measures from whole-system measures. It explains when a single-server model, deterministic-service model or pooled multiserver design matches the process.

Every result is carried into a total-cost comparison that values passenger time alongside server expense and recognises that priority rules redistribute delay even when an aggregate average appears unchanged.

Model choice follows process design

M/M/1 assumes one server with the stated random arrival and service patterns. M/D/1 keeps random arrivals but fixes service duration.

A pooled multiserver system needs a model that recognises several counters rather than pretending their combined rate belongs to one server. Queue discipline also matters. First-come service and priority service can produce different distributions of delay even when the total workload is unchanged.

State these design features before substituting numbers.

Stability comes before waiting

Arrival rate and service rate must share a time unit. A five-minute mean service time becomes twelve passengers per hour, not five passengers per hour. For a steady-state single-server calculation, service capacity must exceed arrivals.

When it does not, the expected queue has no stable long-run value, so a finite waiting result is misleading. Capacity, appointments, routing or demand smoothing must change before the steady-state formula becomes meaningful.

Total cost selects the operating point

A low wait is beneficial and a new server is costly.

The preferred design adds passenger waiting cost, service time where relevant, staffing or equipment expense, and any downstream consequence included consistently for every alternative. Near full utilisation, modest spare capacity can sharply reduce delay. Pooling can share variability across servers without changing nominal capacity.

Priority can protect connecting passengers but transfer time to others, so group-specific effects belong beside the average.

In this chapter

What this chapter covers

  • 01

    Arrival and service rates

  • 02

    Queue stability

  • 03

    M/M/1 model

  • 04

    M/D/1 model

  • 05

    Queue and system time

  • 06

    Little's relationship

  • 07

    Pooled servers

  • 08

    Passenger waiting cost

Worked example · free

Price an automated screening lane

Q [8 marks]. Passengers arrive at 8 per hour and one lane serves 12 per hour with exponential service. Calculate utilisation and average queue waiting time. The marks are an AskSia study allocation, not a University marking scheme.
Passengers arrive at rate lambda, accumulate waiting cost in the queue and leave through service capacity mu.Passengers arrive at rate lambda, accumulate waiting cost in the queue and leave through service capacity mu. The stability condition is visible before any detailed queue formula is used.Arrivals λQueuewaiting costService μstable only when service capacity exceeds arrivals
Passengers arrive at rate lambda, accumulate waiting cost in the queue and leave through service capacity mu. The stability condition is visible before any detailed queue formula is used.
  • 3Check stability and utilisation.
  • 3Calculate queue waiting time.
  • 2Convert time into the decision unit.
Utilisation is 8/12 = 0.667. M/M/1 average queue waiting is 8 divided by 12 times 4, which is one sixth hour or 10 minutes. Passenger time and lane cost must then be compared on a common period.
Sia tip — Convert units and test stability before selecting a waiting formula.
Glossary

Key terms

Arrival Rate
The average number entering a process per time unit.
Service Rate
The average number one server completes per time unit.
Utilisation
Arrival rate divided by available service rate for the stated model.
Queue Time
Time spent waiting before service begins.
System Time
Waiting time plus time in service.
Queue Discipline
The rule deciding which waiting customer receives service next.
FAQ

Airport Operations and Queue Decisions FAQ

Why can delay grow before utilisation reaches one?

Random arrivals create temporary clusters even when average service capacity exceeds average demand. As utilisation approaches one, the system has less spare capacity to clear those clusters, so expected waiting rises sharply.

What is the difference between queue and system time?

Queue time excludes service, while system time includes both waiting and service. The corresponding population measures must use the same boundary when applying Little's relationship.

Why can pooling improve performance?

A pooled line lets the next available server take the next passenger, reducing the chance that one counter is idle while another line grows. The gain comes from sharing variability, not adding nominal capacity.

Study strategy

Exam move

For each queue problem, write units beside arrival and service, invert service time where necessary, test stability, name the model assumptions and label every result with queue or system. Finish by comparing passenger-time value with capacity cost. Rework the same process as one server, separate lines and a pooled line to see which assumptions and outcomes change.

Keep a small conversion bank between minutes per passenger and passengers per hour, because unit inversion is a frequent source of otherwise plausible errors. Draw the system boundary before applying Little's relationship and decide whether the population includes the person in service. For priority cases, report results by passenger group instead of relying on one average.

End revision sets with a capacity recommendation that states the value-of-time assumption and a sensitivity case, since the preferred lane design can reverse when passenger delay is priced differently. Include one unstable case and stop before applying a waiting formula. Explaining why no steady-state answer exists is a complete modelling decision, not a failure to calculate.

Working through Airport Operations and Queue Decisions in AAE5110? Sia is AskSia’s AI Economics tutor — ask any AAE5110 Airport Operations and Queue Decisions question and get a clear, step-by-step explanation grounded in how AAE5110 is taught and assessed. Read this chapter free, then take your hardest questions to Sia.

A+Everything unlocked
Unlocks this Bible + all 24 of your subjects at The Hong Kong Polytechnic University, plus 1,000+ more Bibles across the AskSia library.
Sia - your AAE5110 tutor, unlimited, worked the way the exam marks it
The full 4-page Bible + practice bank with worked solutions
Chrome extension - sync your LMS so Sia knows your deadlines
Bilingual EN / Chinese on every Bible and every Sia answer
$0.99 Trial
30-day money-back · cancel in one tap · how it works