Multi-runway sequencing of unmanned aerial vehicles (UAVs) at temporary disaster relief aerodromes presents a priority-heterogeneous scheduling problem under class-asymmetric wake turbulence constraints. We formulate this as a priority-weighted Markov decision process with a deliberately minimalist reward—per-step class weights for completed landings, with no shaping or hand-crafted safety logic—and extend it with per-UAV operational deadlines (encoding en-route endurance consumption) and per-runway queue capacity constraints that produce a non-trivial action mask. We train a Proximal Policy Optimisation (PPO) agent and benchmark it against six baselines spanning deterministic optimisation (Joint-LA-1), stochastic lookahead (Stochastic-LA), and online tree search (MCTS). Across 100 paired evaluation episodes, PPO matches the operational standard Priority-FCFS within 2.7% (p = 0.124, not significant); Joint-LA-1, the strongest non-learned baseline, outperforms PPO by 3.2% (p = 0.043). Despite near-identical aggregate throughput, PPO autonomously develops a runway specialisation pattern—concentrating 60% of high-priority landings on a single strip while routing 93% of emergency arrivals to the remaining strips—that emerges entirely from the reward signal. Under looser deadlines, the PPO–PFCFS gap narrows to −0.5%, and wake symmetry ablation reveals that PPO outperforms Priority-FCFS by 46.5% when the asymmetric wake structure is removed. These results demonstrate that priority-aware capacity reservation can emerge without embedded domain knowledge, and that simple heuristics are near-optimal under tight operational constraints—a finding with direct implications for autonomous scheduling in disaster relief aviation.