On the complexity of high multiplicity scheduling problems

Nadia Brauner (1) , Y. Crama , A. Grigoriev , J. van de Klundert

1 Leibniz - IMAG - Laboratoire Leibniz

The purpose of this note is to propose a definition of several complexity classes which could prove useful for the analysis of high multiplicity scheduling problems. Part of this framework relies on previous work, aiming at the definition of output-sensitive complexity measures for the analysis of algorithms producing ``large'' outputs. However, the classes differ according as we look at schedules as sets of processing intervals, or as related (single-valued or set-valued) mappings.

Mots clés: complexité; recherche opérationnelle

Domaines: Mathématique discrète [cs.DM]; Combinatoire [math.CO]

Nadia Brauner, Y. Crama, A. Grigoriev, J. van de Klundert. On the complexity of high multiplicity scheduling problems. 2001. ⟨hal-00083365⟩