Scheduling to minimize total weighted completion time: performance guarantees of LP-based heuristics and lower bounds
From MaRDI portal
(Redirected from Publication:4645931)
Recommendations
- scientific article; zbMATH DE number 871909
- Scheduling to minimize total weighted completion time via time-indexed linear programming relaxations
- An experimental study of LP-based approximation algorithms for scheduling problems
- scientific article; zbMATH DE number 2102785
- scientific article; zbMATH DE number 1445389
Cites work
- A multi-stage parallel-processor flowshop problem with minimum flowtime
- A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach
- A supermodular relaxation for scheduling with release dates
- An approximation algorithm for the generalized assignment problem
- Approximation algorithms for scheduling unrelated parallel machines
- Flowshop and Jobshop Schedules: Complexity and Approximation
- Formulating the single machine sequencing problem with release dates as a mixed integer program
- Geometric algorithms and combinatorial optimization
- scientific article; zbMATH DE number 44978 (Why is no real title available?)
- scientific article; zbMATH DE number 3550182 (Why is no real title available?)
- scientific article; zbMATH DE number 2102785 (Why is no real title available?)
- scientific article; zbMATH DE number 871909 (Why is no real title available?)
- Lower bounds for the head-body-tail problem on parallel machines: a computational study of the multiprocessor flow shop
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling independent tasks to reduce mean finishing time
- Scheduling jobs that arrive over time
- Scheduling jobs with communication delays: using infeasible solutions for approximation
- Scheduling to minimize total weighted completion time: performance guarantees of LP-based heuristics and lower bounds
- Scheduling unit jobs with compatible release dates on parallel machines with nonstationary speeds
- Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints
- Structure of a simple scheduling polyhedron
- The Complexity of Flowshop and Jobshop Scheduling
- Worst Case Bound of an LRF Schedule for the Mean Weighted Flow-Time Problem
Cited in
(37)- An experimental study of algorithms for weighted completion time scheduling
- Approximation algorithms for shop scheduling problems with minsum objective
- 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
- Risk-averse single machine scheduling: complexity and approximation
- Approximating total weighted completion time on identical parallel machines with precedence constraints and release dates
- A \((2 + \epsilon)\)-approximation for precedence constrained single machine scheduling with release dates and total weighted completion time objective
- Quality of move-optimal schedules for minimizing total weighted completion time
- Single machine scheduling problems with uncertain parameters and the OWA criterion
- A polytime algorithm based on a primal LP model for the scheduling problem \(1|pmtn;p_j=2;r_j|\sum w_jC_j\)
- Approximating Single Machine Scheduling with Scenarios
- scientific article; zbMATH DE number 1187167 (Why is no real title available?)
- Scheduling with tool changes to minimize total completion time: A study of heuristics and their performance
- A supermodular relaxation for scheduling with release dates
- Scheduling to minimize total weighted completion time: performance guarantees of LP-based heuristics and lower bounds
- scientific article; zbMATH DE number 2102785 (Why is no real title available?)
- scientific article; zbMATH DE number 871909 (Why is no real title available?)
- Approximating the configuration-LP for minimizing weighted sum of completion times on unrelated machines
- scientific article; zbMATH DE number 1445389 (Why is no real title available?)
- 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
- Static routing in stochastic scheduling: performance guarantees and asymptotic optimality
- Randomized mechanism design for decentralized network scheduling
- Decision diagrams for solving a job scheduling problem under precedence constraints
- Hybrid Flow Shop Scheduling: Heuristic Solutions and LP-Based Lower Bounds
- Order Scheduling Models: Hardness and Algorithms
- scientific article; zbMATH DE number 2221455 (Why is no real title available?)
- A note on weighted completion time minimization in a flexible flow shop
- An heuristic approach for solving OSSP with a objective of minimizing total completion time and resource idleness
- Minimizing the sum of weighted completion times in a concurrent open shop
- Fifty years of research in scheduling -- theory and applications
- A flow shop scheduling problem with machine-dependent speeds: an ensemble approach with worst-case analysis
- An EPTAS for minimizing the total weighted completion time of jobs with release dates on uniformly related machines
- An EPTAS for minimizing the total weighted completion time of jobs with release dates on uniformly related machines
- Polytope scheduling with groups: unified models and optimal guarantees
This page was built for publication: Scheduling to minimize total weighted completion time: performance guarantees of LP-based heuristics and lower bounds
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4645931)
