The permutahedron of \(N\)-sparse posets
From MaRDI portal
Publication:2365343
DOI10.1016/0025-5610(96)00007-XzbMath0871.90039OpenAlexW4256218497MaRDI QIDQ2365343
Yaoguang Wang, Rainer Schrader, Annelie von Arnim
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
linear inequalities\(N\)-sparse precedence constraintsjobs with unit processing timespermutahedron of a posetweighted mean completion time
Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)
Related Items
Scheduling unit jobs with compatible release dates on parallel machines with nonstationary speeds ⋮ \(N\)-extendible posets, and how to minimize total weighted completion time ⋮ Cross-series-parallel digraphs ⋮ Facets of the generalized permutahedron of a poset ⋮ Base polytopes of series-parallel posets: Linear description and optimization
