The poset scheduling problem

DOI10.1007/BF00334849MaRDI QIDQ1062616zbMATH OpenFDO

Authors Jack Edmonds, Gerard Jennhwa Chang

Publication date 1985

Published in Order (Search for Journal in Brave)

zbMATH Keywords

NP-completeNP-hardclosed set problemminimum cut problemposet scheduling

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)

Recommendations

• scientific article; zbMATH DE number 4189460
• Schedule-induced posets
• Scheduling of project networks
• Scheduling partially ordered jobs faster than \(2^{n }\)
• scientific article; zbMATH DE number 512916

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Maximal Closure of a Graph and Applications to Combinatorial Problems
• Resource constrained scheduling as generalized bin packing
• Selected Applications of Minimum Cuts in Networks
• Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints

Cited in

(9)

• Minimizing the sum cost in linear extensions of a poset
• The setup polytope of \(N\)-sparse posets
• scientific article; zbMATH DE number 4033467 (Why is no real title available?)
• Project scheduling with irregular costs: complexity, approximability, and algorithms
• Maximizing the expected net present value in a project with uncertain cash flows
• On project scheduling with irregular starting time costs
• A note on order preserving matchings
• scientific article; zbMATH DE number 4189460 (Why is no real title available?)
• Schedule-induced posets

This page was built for publication: The poset scheduling problem

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