Computation of approximate -points for large scale single machine scheduling problem
From MaRDI portal
Computation of approximate \(\alpha \)-points for large scale single machine scheduling problem
Recommendations
- List Scheduling in Order of α-Points on a Single Machine
- Near-optimal solutions of large-scale single-machine scheduling problems
- The power of \(\alpha\)-points in preemptive single machine scheduling.
- An experimental study of LP-based approximation algorithms for scheduling problems
- Single machine scheduling with release dates
Cites work
- scientific article; zbMATH DE number 3550182 (Why is no real title available?)
- scientific article; zbMATH DE number 3614502 (Why is no real title available?)
- scientific article; zbMATH DE number 2084780 (Why is no real title available?)
- scientific article; zbMATH DE number 2109192 (Why is no real title available?)
- scientific article; zbMATH DE number 830382 (Why is no real title available?)
- A Bundle Type Dual-Ascent Approach to Linear Multicommodity Min-Cost Flow Problems
- A Cholesky dual method for proximal piecewise linear programming
- A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
- A time indexed formulation of non-preemptive single machine scheduling problems
- About Lagrangian methods in integer optimization
- An experimental study of LP-based approximation algorithms for scheduling problems
- Comparison of bundle and classical column generation
- Efficiency of proximal bundle methods
- Formulating the single machine sequencing problem with release dates as a mixed integer program
- Lagrangean relaxation. (With comments and rejoinder).
- Minimizing average completion time in the presence of release dates
- New approaches for optimizing over the semimetric polytope
- Proximity control in bundle methods for convex nondifferentiable minimization
- Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
- Single machine scheduling with release dates
- Solving semidefinite quadratic problems within nonsmooth optimization algorithms
- Survey of Bundle Methods for Nonsmooth Optimization
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- Time-Indexed Formulations for Machine Scheduling Problems: Column Generation
- Variable target value subgradient method
Cited in
(6)- Near-optimal solutions of large-scale single-machine scheduling problems
- List Scheduling in Order of α-Points on a Single Machine
- Machine Scheduling to Minimize Weighted Completion Times
- A better online algorithm for the parallel machine scheduling to minimize the total weighted completion time
- Integer Programming and Combinatorial Optimization
- An on-line \textit{seru} scheduling algorithm with proactive waiting considering resource conflicts
This page was built for publication: Computation of approximate \(\alpha \)-points for large scale single machine scheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2482376)
