The permutahedron of N-sparse posets

DOI10.1016/0025-5610(96)00007-XMaRDI QIDQ2365343zbMATH OpenOpenAlexFDO

Authors Annelie von Arnim, Rainer Schrader, Yaoguang Wang

Publication date 22 January 1997

Published in Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0025-5610(96)00007-x

zbMATH Keywords

\(N\)-sparse precedence constraintsjobs with unit processing timeslinear inequalitiespermutahedron of a posetweighted mean completion time

Mathematics Subject Classification ID

Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Recommendations

• The permutahedron of series-parallel posets
• Facets of the generalized permutahedron of a poset
• The setup polytope of \(N\)-sparse posets
• The permutahedron of series-parallel posets

Cited in

(9)

• Base polytopes of series-parallel posets: Linear description and optimization
• The setup polytope of \(N\)-sparse posets
• \(N\)-extendible posets, and how to minimize total weighted completion time
• Cross-series-parallel digraphs
• On the sparseness of the downsets of permutations via their number of separators
• Scheduling unit jobs with compatible release dates on parallel machines with nonstationary speeds
• Poset vectors and generalized permutohedra
• The permutahedron of series-parallel posets
• Facets of the generalized permutahedron of a poset

This page was built for publication: The permutahedron of \(N\)-sparse posets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2365343)