Liebling, Th. M.Margot, F.Prodon, A.Rieder, U.Gessner, P.Peyerimhoff, A.Radermacher, F.2006-02-132006-02-132006-02-131989https://infoscience.epfl.ch/handle/20.500.14299/222582The poser scheduling problem has been shown to be NP-complete in the general case but in P for a special case by Chang and Edmonds. In this paper, we extend the class of polynomially solvable cases and give some polyhedral characterizations.text::conference output::conference proceedings::conference paper