Precedence constrained scheduling to minimize sum of weighted completion times on a single machine
From MaRDI portal
Publication:1961232
Recommendations
- A fully combinatorial 2-approximation algorithm for precedence-constrained scheduling a single machine to minimize average weighted completion time
- On the approximability of single-machine scheduling with precedence constraints
- Task scheduling with precedence constraints to minimize the total completion time
- Single-Machine Scheduling with Precedence Constraints
- Single-machine scheduling with precedence constraints and position-dependent processing times
- Single machine scheduling with precedence constraints and positionally dependent processing times
- An exact algorithm for the precedence-constrained single-machine scheduling problem
- Scheduling of parallel machines to minimize total completion time subject to s-precedence constraints
- Preemptive scheduling with availability constraints to minimize total weighted completion times
- Minimizing Total Tardiness on a Single Machine with Precedence Constraints
Cites work
- A Fast Parametric Maximum Flow Algorithm and Applications
- A new approach to the maximum-flow problem
- An algorithm for the single machine sequencing problem with precedence constraints
- Decomposition Algorithms for Single-Machine Sequencing with Precedence Relations and Deferral Costs
- scientific article; zbMATH DE number 1187165 (Why is no real title available?)
- scientific article; zbMATH DE number 176780 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 2102785 (Why is no real title available?)
- scientific article; zbMATH DE number 819814 (Why is no real title available?)
- scientific article; zbMATH DE number 6472638 (Why is no real title available?)
- Optimal task sequencing with precedence constraints
- Scheduling chain-structured tasks to minimize makespan and mean flow time
- Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
- Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints
- Single Machine Job Sequencing with Precedence Constraints
- Single-Machine Job Sequencing with Treelike Precedence Ordering and Linear Delay Penalties
- Single-Machine Scheduling Polyhedra with Precedence Constraints
Cited in
(50)- Single machine precedence constrained scheduling is a Vertex cover problem
- Approximation results for a bicriteria job scheduling problem on a single machine without preemption
- An iterative algorithm for scheduling unit-times tasks with precedence constraints to minimise the maximum lateness
- On the approximability of average completion time scheduling under precedence constraints.
- A fully combinatorial 2-approximation algorithm for precedence-constrained scheduling a single machine to minimize average weighted completion time
- A 1. 47-approximation for a preemptive single-machine scheduling problem
- The benefit of preemption for single machine scheduling so as to minimize total weighted completion time
- A 2.542-approximation for precedence constrained single machine scheduling with release dates and total weighted completion time objective
- Preemptive scheduling with availability constraints to minimize total weighted completion times
- A half-integral linear programming relaxation for scheduling precedence-constrained jobs on a single machine
- Precedence theorems and dynamic programming for the single-machine weighted tardiness problem
- Precedence-constrained scheduling and min-sum set cover (extended Abstract)
- Preemptive and non-preemptive generalized min sum set cover
- Scheduling of tasks with effectiveness precedence constraints
- An exact algorithm for the precedence-constrained single-machine scheduling problem
- Minimum equivalent precedence relation systems
- A \((2 + \epsilon)\)-approximation for precedence constrained single machine scheduling with release dates and total weighted completion time objective
- Asymptotically optimal schedules for single-server flow shop problems with setup costs and times
- The constrained minimum weighted sum of job completion times problem
- A 2-approximation algorithm for the network substitution problem
- Online Linear Optimization for Job Scheduling Under Precedence Constraints
- On the approximability of single-machine scheduling with precedence constraints
- Vertex cover in graphs with locally few colors
- Near-optimal solutions and large integrality gaps for almost all instances of single-machine precedence-constrained scheduling
- Approximating weighted completion time for order scheduling with setup times
- A short note on the approximation of the single machine scheduling problem to minimize makespan with fixed jobs and precedence constraints
- Approximating Single Machine Scheduling with Scenarios
- Decompositions, Network Flows, and a Precedence Constrained Single-Machine Scheduling Problem
- scientific article; zbMATH DE number 176780 (Why is no real title available?)
- scientific article; zbMATH DE number 2081111 (Why is no real title available?)
- scientific article; zbMATH DE number 1754642 (Why is no real title available?)
- Min-sum scheduling under precedence constraints
- Minimizing the total weighted completion time for the relocation scheduling problems with precedence constraints
- A General Framework for Approximating Min Sum Ordering Problems
- On Submodular Search and Machine Scheduling
- Scheduling to minimize total weighted completion time via time-indexed linear programming relaxations
- Solving zero-sum games using best-response oracles with applications to search games
- Precedence-Constrained Min Sum Set Cover
- Decision diagrams for solving a job scheduling problem under precedence constraints
- scientific article; zbMATH DE number 3894817 (Why is no real title available?)
- Lift and project algorithms for precedence constrained scheduling to minimize completion time
- Scheduling partially ordered jobs faster than \(2^n\)
- Integer Programming and Combinatorial Optimization
- Minimizing the total weighted duration of courses in a single machine problem with precedence constraints
- Hardness and approximation of submodular minimum linear ordering problems
- On min sum vertex cover and generalized min sum set cover
- Scheduling with bully selfish jobs
- A 2-OPT procedure to reduce total inspection time in a serial inspection process
- Partially ordered knapsack and applications to scheduling
- Scheduling of parallel machines to minimize total completion time subject to s-precedence constraints
This page was built for publication: Precedence constrained scheduling to minimize sum of weighted completion times on a single machine
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1961232)
