Lexicographic aggregation of semiorders

It is well known that the lexicographic aggregation of complete preorders gives a complete preorder. Unfortunately, this property is no longer true when the lexicographic rule is applied to semiorders. In this paper we study some ways of defining a lexicographic aggregation of semiorders and the properties of the resulting structures.