This report describes several scheduling algorithms that may form part of the interrogation management function of a discrete address beacon system. These include scheduling algorithms that can handle unequal message lengths and types which can schedule a message very rapidly (dynamic scheduling). The algorithms are evaluated in terms of the computation required to execute them and their packing efficiencies.