conference paper
The poset scheduling problem
1989
Methods of Operations Research
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.
Type
conference paper
Author(s)
Date Issued
1989
Published in
Methods of Operations Research
Start page
221
End page
230
Note
PRO 89.10
Written at
EPFL
EPFL units
Available on Infoscience
February 13, 2006
Use this identifier to reference this record