N-extendible posets, and how to minimize total weighted completion time
From MaRDI portal
Publication:1962041
Recommendations
- The Complexity of the Extendibility Problem for Finite Posets
- Minimizing the sum cost in linear extensions of a poset
- Combinatorial algorithms for minimizing the weighted sum of completion times on a single machine
- scientific article; zbMATH DE number 1759433
- NP-partitions over posets with an application to reducing the set of solutions of NP problems
- scientific article; zbMATH DE number 7759298
- Minimizing the sum of weighted completion times with unrestricted weights
- Minimizing the maximum bump cost in linear extensions of a poset
Cites work
- scientific article; zbMATH DE number 3906240 (Why is no real title available?)
- scientific article; zbMATH DE number 6472575 (Why is no real title available?)
- P4-Reducible Graphs-Class of Uniquely Tree-Representable Graphs
- A tree representation for \(P_ 4\)-sparse graphs
- Decomposition Algorithms for Single-Machine Sequencing with Precedence Relations and Deferral Costs
- Interval orders without odd crowns are defect optimal
- On a unique tree representation for \(P_ 4\)-extendible graphs
- On the \(p\)-connectedness of graphs---a survey
- Optimal Sequencing by Modular Decomposition: Polynomial Algorithms
- Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints
- The permutahedron of \(N\)-sparse posets
This page was built for publication: \(N\)-extendible posets, and how to minimize total weighted completion time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1962041)
