Facets of the Generalized Permutahedron of a Poset

@article{Arnim1997FacetsOT,
  title={Facets of the Generalized Permutahedron of a Poset},
  author={Annelie von Arnim and A. Schulz},
  journal={Discret. Appl. Math.},
  year={1997},
  volume={72},
  pages={179-192}
}
  • Annelie von Arnim, A. Schulz
  • Published 1997
  • Mathematics, Computer Science
  • Discret. Appl. Math.
  • Abstract Given a poset P as a precedence relation on a set of jobs with processing time vector p, the generalized permutahedron perm(P, p) of P is defined as the convex hull of all job completion time vectors corresponding to a linear extension of P. Thus, the generalized permutahedron allows for the single machine weighted flowtime scheduling problem to be formulated as a linear programming problem over perm(P, p). Queyranne and Wang [8]as well as von Arnim and Schrader [2]gave a collection of… CONTINUE READING

    Topics from this paper.

    Polyhedral Approaches to Machine Scheduling
    117
    On the linear description of the Huffman trees polytope
    Online Linear Optimization over Permutations
    31

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 35 REFERENCES
    Single-Machine Scheduling Polyhedra with Precedence Constraints
    69
    Structure of a simple scheduling polyhedron
    207
    Complexity of Scheduling under Precedence Constraints
    414
    The permutahedron of series-parallel posets
    20
    Polyedrische Charakterisierung von Scheduling Problemen, Diploma Thesis, Department of Mathematics
    • 1993
    Single{Machine Scheduling Polyhedra with Precedence Con- straints
    • 1991
    A Cutting Plane Procedure for Precedence{Constrained Sin- gle Machine Scheduling, Preprint, Faculty of Commerce, University of British Columbia
    • 1991
    A Cutting Plane Procedure for Precedence{Constrained Single Machine Scheduling
    • 1991