On some synchronization problems with multiple instances

Many classical synchronization problems such as the assembly line crew scheduling problem (ALCS), some data association problems or multisensor tracking problems can be formulated as finding intra-column rearrangements for a single matrix representing costs, distances, similarities or time requirements. In this paper, we consider an extension of these problems to the case of multiple matrices, reflecting various possible instances (scenarios)....