The poset scheduling problem
1989
Abstract
The 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.
Details
Title
The poset scheduling problem
Author(s)
Liebling, Th. M. ; Margot, F. ; Prodon, A. ; Rieder, U. ; Gessner, P. ; Peyerimhoff, A. ; Radermacher, F.
Published in
Methods of Operations Research
Pages
221-230
Date
1989
Note
PRO 89.10
Laboratories
ROSO
Record Appears in
Scientific production and competences > SB - School of Basic Sciences > SB Archives > ROSO - Chair of Operations Research SO
Scientific production and competences > SB - School of Basic Sciences > Mathematics
Conference Papers
Work produced at EPFL
Published
Scientific production and competences > SB - School of Basic Sciences > Mathematics
Conference Papers
Work produced at EPFL
Published
Record creation date
2006-02-13