A polynomial algorithm for recognizing the \(\mathcal A\)-order class
From MaRDI portal
Publication:1043599
DOI10.1016/j.disc.2008.10.032zbMath1227.05239OpenAlexW2103040812MaRDI QIDQ1043599
Publication date: 9 December 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2008.10.032
Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)
Cites Work
- Unnamed Item
- Preemptive scheduling of interval orders is polynomial
- A relation between multiprocessor scheduling and linear programming
- Scheduling unitary task systems with zero--one communication delays for quasi-interval orders
- Scheduling preemptive jobs with precedence constraints on parallel machines
- Optimal preemptive scheduling on a fixed number of identical parallel machines
- Scheduling Interval-Ordered Tasks
- The Coffman--Graham Algorithm Optimally Solves UET Task Systems with Overinterval Orders