The poset scheduling problem

DOI10.1007/BF00334849zbMath0572.90055MaRDI QIDQ1062616

Jack Edmonds, Gerard Jennhwa Chang

Publication date: 1985

Published in: Order (Search for Journal in Brave)

zbMATH Keywords

NP-hardNP-completeclosed set problemminimum cut problemposet scheduling

Mathematics Subject Classification ID

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

Related Items (4)

The Parametric Closure Problem ⋮ Maximizing the expected net present value in a project with uncertain cash flows ⋮ Project scheduling with irregular costs: complexity, approximability, and algorithms ⋮ On project scheduling with irregular starting time costs

Cites Work

• Unnamed Item
• Resource constrained scheduling as generalized bin packing
• Selected Applications of Minimum Cuts in Networks
• Maximal Closure of a Graph and Applications to Combinatorial Problems
• Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints

This page was built for publication: The poset scheduling problem