A priority queue transforms an input sequence ~r into an output sequence r which is a re-ordering of the sequence ~r. The set R of all such related pairs is studied in the case that tr is a binary sequence. It is proved that R is a partial order and that IRI = c,~+1, the (n + 1)th Catalan number, An efficient (O(n2)) algorithm is given for computing the number of outputs achievable from a given...

This paper investigates the use of genetic programming in automatized synthesis of scheduling heuristics. The applied scheduling technique is priority scheduling, where the next state of the system is determined based on priority values of certain system elements. The evolved solutions are compared with existing scheduling heuristics for single machine dynamic problem and job shop scheduling wi...

In this paper, we consider the following variant of the matroid intersection problem. We are given two matroids M1,M2 on the same ground set E and a subset A of E. Our goal is to find a common independent set I of M1,M2 such that |I ∩A| is maximum among all common independent sets of M1,M2 and such that (secondly) |I| is maximum among all common independent sets of M1,M2 satisfying the first co...

I study two prominent strategyproof matching rules when strict priorities over objects are given exogenously: the Deferred Acceptance Rule (DA) and the Top Trading Cycle Rule With Inheritance (TTC). It is well known that the DA rule is stable while the TTC rule is efficient, but not vice versa, and that these two properties cannot be reconciled. The primary innovation of the paper is the introd...