Dual relaxations of the time-indexed ILP formulation for min-sum scheduling problems
From MaRDI portal
Publication:513629
DOI10.1007/s10479-014-1776-2zbMath1357.90056OpenAlexW1971343656MaRDI QIDQ513629
Publication date: 7 March 2017
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-014-1776-2
Related Items
Parallel-machine serial-batching scheduling with release times under the effects of position-dependent learning and time-dependent deterioration, Exact and matheuristic methods for the parallel machine scheduling and location problem with delivery time and due date, An improved decision support model for scheduling production in an engineer-to-order manufacturer
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A branch and bound algorithm to minimize total weighted tardiness on a single processor
- Formulating the single machine sequencing problem with release dates as a mixed integer program
- On the equivalence of the Max-min transportation lower bound and the time-indexed lower bound for single-machine scheduling problems
- A time indexed formulation of non-preemptive single machine scheduling problems
- A survey of algorithms for the single machine total weighted tardiness scheduling problem
- A dynamic programming method for single machine scheduling
- An exact algorithm for IP column generation
- An exact algorithm for single-machine scheduling without machine idle time
- A dynamic-programming-based exact algorithm for general single-machine scheduling with machine idle time
- Recovering an optimal LP basis from an optimal dual solution
- Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates
- Branch-and-Price: Column Generation for Solving Huge Integer Programs
- An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem
- Combinatorial Auctions: A Survey
- The Continuous Assignment Problem and Its Application to Preemptive and Non-Preemptive Scheduling with Irregular Cost Functions
- Near-Optimal Solutions of Large-Scale Single-Machine Scheduling Problems
- Time-Indexed Formulations and the Total Weighted Tardiness Problem
- Solving Project Scheduling Problems by Minimum Cut Computations
- CABOB: A Fast Optimal Algorithm for Winner Determination in Combinatorial Auctions
- A Branch-and-Price Algorithm and New Test Problems for Spectrum Auctions
- A Branch and Bound Algorithm for the Total Weighted Tardiness Problem
- Dynamic Programming State-Space Relaxation for Single-Machine Scheduling
- A dual algorithm for the one-machine scheduling problem
- Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
- Time-Indexed Formulations for Machine Scheduling Problems: Column Generation
- Radar pulse interleaving for multi‐target tracking
- Column Generation
- Selected Topics in Column Generation
- Bottleneck Problems and Dynamic Programming
