Computation of approximate -points for large scale single machine scheduling problem

DOI10.1016/J.COR.2007.02.018zbMATH Open1162.90010OpenAlexW2083391491MaRDI QIDQ2482376FDOQ2482376

Authors: Hanyu Gu 

Publication date: 16 April 2008

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2007.02.018

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

zbMATH Keywords

single machine schedulingproximal bundle methodLagrangian relaxation, \(\alpha\)-point

Mathematics Subject Classification ID

Linear programming (90C05) Deterministic scheduling theory in operations research (90B35)

Cites Work

• A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
• Title not available (Why is that?)
• Proximity control in bundle methods for convex nondifferentiable minimization
• Comparison of bundle and classical column generation
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• Title not available (Why is that?)
• A Bundle Type Dual-Ascent Approach to Linear Multicommodity Min-Cost Flow Problems
• Title not available (Why is that?)
• Title not available (Why is that?)
• A time indexed formulation of non-preemptive single machine scheduling problems
• Survey of Bundle Methods for Nonsmooth Optimization
• Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
• Title not available (Why is that?)
• Lagrangean relaxation. (With comments and rejoinder).
• About Lagrangian methods in integer optimization
• Time-Indexed Formulations for Machine Scheduling Problems: Column Generation
• An experimental study of LP-based approximation algorithms for scheduling problems
• Formulating the single machine sequencing problem with release dates as a mixed integer program
• New approaches for optimizing over the semimetric polytope
• Single machine scheduling with release dates
• Efficiency of proximal bundle methods
• A Cholesky dual method for proximal piecewise linear programming
• Solving semidefinite quadratic problems within nonsmooth optimization algorithms
• Minimizing average completion time in the presence of release dates
• 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)