Single Machine Scheduling with Precedence Constraints of Dimension 2
From MaRDI portal
(Redirected from Publication:3329201)
Recommendations
- Single Machine Scheduling with Series-Parallel Precedence Constraints
- scientific article; zbMATH DE number 5605136
- Approximating Precedence-Constrained Single Machine Scheduling by Coloring
- Scheduling with Precedence Constraints of Low Fractional Dimension
- Scheduling partially ordered jobs faster than \(2^n\)
Cited in
(16)- Single machine precedence constrained scheduling is a Vertex cover problem
- A compact labelling scheme for series-parallel graphs
- An algorithm to generate the ideals of a partial order
- On the computational complexity of the order polynomial
- Transitive closure for restricted classes of partial orders
- On estimating the number of order ideals in partial orders, with some applications
- The use of dynamic programming in genetic algorithms for permutation problems
- Understanding the generalized median stable matchings
- Transversal graphs for partially ordered sets: Sequencing, merging and scheduling problems
- A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems
- Algorithmic combinatorics based on slicing posets
- Scheduling partially ordered jobs faster than \(2^{n }\)
- The minimum dummy task problem
- Single Machine Scheduling with Series-Parallel Precedence Constraints
- scientific article; zbMATH DE number 1305426 (Why is no real title available?)
- On the complexity of dynamic programming for sequencing problems with precedence constraints
This page was built for publication: Single Machine Scheduling with Precedence Constraints of Dimension 2
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3329201)
