The counting complexity of a simple scheduling problem
From MaRDI portal
Publication:1038110
DOI10.1016/j.orl.2009.05.004zbMath1173.90399MaRDI QIDQ1038110
Publication date: 17 November 2009
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2009.05.004
90B35: Deterministic scheduling theory in operations research
Related Items
Cites Work
- The complexity of computing the permanent
- Counting feasible solutions of the traveling salesman problem with pickups and deliveries is \#\(P\)-complete
- The Complexity of Enumeration and Reliability Problems
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
- Optimal Sequencing of a Single Machine Subject to Precedence Constraints
- Counting and enumeration complexity with application to multicriteria scheduling