Dual relaxations of the time-indexed ILP formulation for min-sum scheduling problems
From MaRDI portal
(Redirected from Publication:513629)
Recommendations
- A time-indexed LP-based approach for min-sum job-shop problems
- Time-Indexed Formulations for Machine Scheduling Problems: Column Generation
- Scheduling to minimize total weighted completion time via time-indexed linear programming relaxations
- scientific article; zbMATH DE number 1187167
- Dual decomposition of a single-machine scheduling problem
Cites work
- scientific article; zbMATH DE number 3356467 (Why is no real title available?)
- A Branch and Bound Algorithm for the Total Weighted Tardiness Problem
- A branch and bound algorithm to minimize total weighted tardiness on a single processor
- A branch-and-price algorithm and new test problems for spectrum auctions
- A dual algorithm for the one-machine scheduling problem
- A dynamic programming method for single machine scheduling
- A dynamic-programming-based exact algorithm for general single-machine scheduling with machine idle time
- A survey of algorithms for the single machine total weighted tardiness scheduling problem
- A time indexed formulation of non-preemptive single machine scheduling problems
- An exact algorithm for IP column generation
- An exact algorithm for single-machine scheduling without machine idle time
- An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem
- Bottleneck Problems and Dynamic Programming
- Branch-and-price: Column generation for solving huge integer programs
- CABOB: A Fast Optimal Algorithm for Winner Determination in Combinatorial Auctions
- Column Generation
- Combinatorial auctions. Foreword by Vernon L. Smith.
- Combinatorial auctions: a survey
- Dynamic Programming State-Space Relaxation for Single-Machine Scheduling
- Formulating the single machine sequencing problem with release dates as a mixed integer program
- Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates
- Near-optimal solutions of large-scale single-machine scheduling problems
- On the equivalence of the Max-min transportation lower bound and the time-indexed lower bound for single-machine scheduling problems
- Radar pulse interleaving for multi‐target tracking
- Recovering an optimal LP basis from an optimal dual solution
- Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
- Selected Topics in Column Generation
- Solving project scheduling problems by minimum cut computations
- The continuous assignment problem and its application to preemptive and non-preemptive scheduling with irregular cost functions
- Time-Indexed Formulations for Machine Scheduling Problems: Column Generation
- Time-indexed formulations and the total weighted tardiness problem
Cited in
(4)- A time-indexed LP-based approach for min-sum job-shop problems
- Exact and matheuristic methods for the parallel machine scheduling and location problem with delivery time and due date
- Parallel-machine serial-batching scheduling with release times under the effects of position-dependent learning and time-dependent deterioration
- An improved decision support model for scheduling production in an engineer-to-order manufacturer
This page was built for publication: Dual relaxations of the time-indexed ILP formulation for min-sum scheduling problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q513629)
