A primal-dual approximation algorithm for Min-sum single-machine scheduling problems
From MaRDI portal
Recommendations
- A primal-dual approximation algorithm for min-sum single-machine scheduling problems
- A 1. 47-approximation for a preemptive single-machine scheduling problem
- Approximation algorithms for scheduling a single machine to minimize total late work
- scientific article; zbMATH DE number 871909
- Optimal algorithms and a PTAS for cost-aware scheduling
Cites work
- scientific article; zbMATH DE number 5485535 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1445293 (Why is no real title available?)
- A constant factor approximation algorithm for generalized MIN-sum set cover
- A primal-dual approximation algorithm for Min-sum single-machine scheduling problems
- A primal-dual approximation algorithm for min-sum single-machine scheduling problems
- A primal-dual randomized algorithm for weighted paging
- A unified approach to approximating resource allocation and scheduling
- Approximability of Sparse Integer Programs
- Dual techniques for scheduling on a machine with varying speed
- How Unsplittable-Flow-Covering Helps Scheduling with Job-Dependent Cost Functions
- On the Equivalence between the Primal-Dual Schema and the Local Ratio Technique
- On the Performance of Smith’s Rule in Single-Machine Scheduling with Nonlinear Cost
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Primal-Dual Schema for Capacitated Covering Problems
- Scheduling with Outliers
- Universal sequencing on an unreliable machine
- Valid Linear Inequalities for Fixed Charge Problems
Cited in
(20)- Using fractional primal-dual to schedule split intervals with demands
- Approximation Algorithms and Linear Programming Relaxations for Scheduling Problems Related to Min-Sum Set Cover
- A water-filling primal-dual algorithm for approximating nonlinear covering problems
- scientific article; zbMATH DE number 7561579 (Why is no real title available?)
- How unsplittable-flow-covering helps scheduling with job-dependent cost functions
- Algorithms – ESA 2005
- Robust Appointment Scheduling with Heterogeneous Costs
- Risk-averse single machine scheduling: complexity and approximation
- Approximation algorithm with constant ratio for stochastic prize-collecting Steiner tree problem
- A water-filling primal-dual algorithm for approximating nonlinear covering problems
- Dual techniques for scheduling on a machine with varying speed
- On scheduling a single machine to minimize a piecewise linear objective function: A compact MIP formulation
- An unbounded sum-of-squares hierarchy integrality gap for a polynomially solvable problem
- A Lasserre lower bound for the min-sum single machine scheduling problem
- A primal-dual approximation algorithm for min-sum single-machine scheduling problems
- A primal-dual approximation algorithm for Min-sum single-machine scheduling problems
- A polynomial-time approximation scheme for the airplane refueling problem
- An Optimal Control Framework for Online Job Scheduling with General Cost Functions
- Fixed-parameter algorithms for unsplittable flow cover
- Optimal algorithms for scheduling under time-of-use tariffs
This page was built for publication: A primal-dual approximation algorithm for Min-sum single-machine scheduling problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5346558)
