Decompositions, Network Flows, and a Precedence Constrained Single-Machine Scheduling Problem
From MaRDI portal
Publication:3637403
Recommendations
- Integer Programming and Combinatorial Optimization
- Single-Machine Scheduling with Precedence Constraints
- A half-integral linear programming relaxation for scheduling precedence-constrained jobs on a single machine
- Precedence constrained scheduling to minimize sum of weighted completion times on a single machine
- scientific article; zbMATH DE number 871909
Cited in
(25)- On Submodular Search and Machine Scheduling
- Approximation algorithms for scheduling problems with a modified total weighted tardiness objective
- Approximating Single Machine Scheduling with Scenarios
- Decision diagrams for solving a job scheduling problem under precedence constraints
- A General Framework for Approximating Min Sum Ordering Problems
- An integer programming approach to optimal basic block instruction scheduling for single-issue processors
- Designing PTASs for MIN-SUM scheduling problems
- Preemptive and non-preemptive generalized min sum set cover
- Precedence theorems and dynamic programming for the single-machine weighted tardiness problem
- A decomposition scheme for single stage scheduling problems
- Asymptotically optimal schedules for single-server flow shop problems with setup costs and times
- An exact dynamic programming algorithm for the precedence-constrained class sequencing problem
- On the approximability of average completion time scheduling under precedence constraints.
- Hardness and approximation of submodular minimum linear ordering problems
- Online Linear Optimization for Job Scheduling Under Precedence Constraints
- Single machine precedence constrained scheduling is a Vertex cover problem
- Approximation results for a bicriteria job scheduling problem on a single machine without preemption
- Partially ordered knapsack and applications to scheduling
- Vertex cover in graphs with locally few colors
- Dual decomposition of a single-machine scheduling problem
- Decomposition algorithm for the single machine scheduling polytope
- On min sum vertex cover and generalized min sum set cover
- A half-integral linear programming relaxation for scheduling precedence-constrained jobs on a single machine
- An exact algorithm for the precedence-constrained single-machine scheduling problem
- Scheduling partially ordered jobs faster than \(2^n\)
This page was built for publication: Decompositions, Network Flows, and a Precedence Constrained Single-Machine Scheduling Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3637403)
