An experimental study of LP-based approximation algorithms for scheduling problems
From MaRDI portal
Recommendations
- New approximation bounds for LPT scheduling
- On the optimality of exact and approximation algorithms for scheduling problems
- scientific article; zbMATH DE number 1982192
- Strategies for LP-based solving a general class of scheduling problems
- Approximation scheduling algorithms: a survey
- Approximation algorithms for some discrete-continuous scheduling problems
- scientific article; zbMATH DE number 3974707
- On approximating a scheduling problem
- scientific article; zbMATH DE number 1560337
- Tighter approximation bounds for LPT scheduling in two special cases
Cited in
(26)- scientific article; zbMATH DE number 7112744 (Why is no real title available?)
- A probe-based algorithm for piecewise linear optimization in scheduling
- Computation of approximate -points for large scale single machine scheduling problem
- Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates
- A novel integer programing formulation for scheduling with family setup times on a single machine to minimize maximum lateness
- Analysis of bounds for a capacitated single-item lot-sizing problem
- Off-line admission control for general scheduling problems
- Tighter approximation bounds for LPT scheduling in two special cases
- On the relationship between combinatorial and LP-based lower bounds for NP-hard scheduling problems
- An experimental study of algorithms for weighted completion time scheduling
- Network construction problems with due dates
- Almost sure asymptotic optimality for online routing and machine scheduling problems
- A bucket indexed formulation for nonpreemptive single machine scheduling problems
- A better online algorithm for the parallel machine scheduling to minimize the total weighted completion time
- Scheduling to minimize total weighted completion time: performance guarantees of LP-based heuristics and lower bounds
- A time-indexed LP-based approach for min-sum job-shop problems
- Scheduling network maintenance jobs with release dates and deadlines to maximize total flow over time: bounds and solution strategies
- Tighter Approximation Bounds for LPT Scheduling in Two Special Cases
- Time-indexed formulations for scheduling chains on a single machine: an application to airborne radars
- LP-based online scheduling: From single to parallel machines
- scientific article; zbMATH DE number 1187167 (Why is no real title available?)
- Restoring infrastructure systems: an integrated network design and scheduling (INDS) problem
- LP rounding and combinatorial algorithms for minimizing active and busy time
- Integrating restoration and scheduling decisions for disrupted interdependent infrastructure systems
- A branch and cut heuristic for a runway scheduling problem
- An on-line \textit{seru} scheduling algorithm with proactive waiting considering resource conflicts
This page was built for publication: An experimental study of LP-based approximation algorithms for scheduling problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2890462)
