000077007 001__ 77007
000077007 005__ 20180127193035.0
000077007 037__ $$aCONF
000077007 245__ $$aThe poset scheduling problem
000077007 260__ $$c1989
000077007 269__ $$a1989
000077007 336__ $$aConference Papers
000077007 500__ $$aPRO 89.10
000077007 520__ $$aThe 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.
000077007 700__ $$0241744$$aLiebling, Th. M.$$g105665
000077007 700__ $$aMargot, F.
000077007 700__ $$aProdon, A.
000077007 700__ $$aRieder, U.
000077007 700__ $$aGessner, P.
000077007 700__ $$aPeyerimhoff, A.
000077007 700__ $$aRadermacher, F.
000077007 773__ $$q221-230$$tMethods of Operations Research
000077007 909C0 $$0252055$$pROSO
000077007 909CO $$ooai:infoscience.tind.io:77007$$pconf
000077007 937__ $$aROSO-CONF-1989-003
000077007 970__ $$aLiebling1989_595/ROSO
000077007 973__ $$aEPFL$$sPUBLISHED
000077007 980__ $$aCONF