Infoscience

Conference paper

The poset scheduling problem

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.

    Note:

    PRO 89.10

    Reference

    • ROSO-CONF-1989-003

    Record created on 2006-02-13, modified on 2016-08-08

Fulltext

  • There is no available fulltext. Please contact the lab or the authors.

Related material