Single-Machine Scheduling with Precedence Constraints
From MaRDI portal
Publication:5387960
DOI10.1287/moor.1050.0158zbMath1278.90148WikidataQ65553925 ScholiaQ65553925MaRDI QIDQ5387960
Andreas S. Schulz, José R. Correa
Publication date: 27 May 2008
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/628cac0166232e2098640c0f033c371ffb06f611
scheduling; approximation algorithm; partial order; linear programming relaxation; vertex cover; linear ordering; integer programming formulation
90C10: Integer programming
90C05: Linear programming
90B35: Deterministic scheduling theory in operations research
Related Items
Exact and Approximation Algorithms for the Expanding Search Problem, A General Framework for Approximating Min Sum Ordering Problems, On Submodular Search and Machine Scheduling, Decision diagrams for solving a job scheduling problem under precedence constraints, Equitable scheduling on a single machine, Minimizing I/Os in Out-of-Core Task Tree Scheduling, The feedback arc set problem with triangle inequality is a vertex cover problem, The precedence constrained knapsack problem: separating maximally violated inequalities, Mixed integer formulations using natural variables for single machine scheduling around a common due date, Partially ordered knapsack and applications to scheduling, Single machine precedence constrained scheduling is a Vertex cover problem, A survey on how the structure of precedence constraints may change the complexity class of scheduling problems, An integer programming approach to optimal basic block instruction scheduling for single-issue processors, A 2.542-approximation for precedence constrained single machine scheduling with release dates and total weighted completion time objective, Precedence theorems and dynamic programming for the single-machine weighted tardiness problem, A new heuristic and an exact approach for a production planning problem, Integrated optimization of test case selection and sequencing for reliability testing of the mainboard of Internet backbone routers, Restoring infrastructure systems: an integrated network design and scheduling (INDS) problem, Scheduling of tasks with effectiveness precedence constraints, An exact algorithm for the precedence-constrained single-machine scheduling problem, Online Linear Optimization for Job Scheduling Under Precedence Constraints, Vertex Cover in Graphs with Locally Few Colors, Approximate Deadline-Scheduling with Precedence Constraints, Approximating Single Machine Scheduling with Scenarios
