Dual relaxations of the time-indexed ILP formulation for min-sum scheduling problems
From MaRDI portal
Publication:513629
DOI10.1007/S10479-014-1776-2zbMATH Open1357.90056OpenAlexW1971343656MaRDI QIDQ513629FDOQ513629
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
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
- Dual decomposition of a single-machine scheduling problem
Cites Work
- CABOB: A Fast Optimal Algorithm for Winner Determination in Combinatorial Auctions
- An exact algorithm for IP column generation
- Selected Topics in Column Generation
- Branch-and-price: Column generation for solving huge integer programs
- Combinatorial auctions: a survey
- A time indexed formulation of non-preemptive single machine scheduling problems
- 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
- Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
- Column Generation
- Title not available (Why is that?)
- Time-Indexed Formulations for Machine Scheduling Problems: Column Generation
- Title not available (Why is that?)
- Solving Project Scheduling Problems by Minimum Cut Computations
- A survey of algorithms for the single machine total weighted tardiness scheduling problem
- A dynamic programming method for single machine scheduling
- A Branch and Bound Algorithm for the Total Weighted Tardiness Problem
- Dynamic Programming State-Space Relaxation for Single-Machine Scheduling
- Formulating the single machine sequencing problem with release dates as a mixed integer program
- An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem
- Near-optimal solutions of large-scale single-machine scheduling problems
- Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates
- Time-indexed formulations and the total weighted tardiness problem
- A dual algorithm for the one-machine scheduling problem
- 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
- Bottleneck Problems and Dynamic Programming
- Recovering an optimal LP basis from an optimal dual solution
- The continuous assignment problem and its application to preemptive and non-preemptive scheduling with irregular cost functions
- A Branch-and-Price Algorithm and New Test Problems for Spectrum Auctions
- A branch and bound algorithm to minimize total weighted tardiness on a single processor
Cited In (3)
- 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
- Exact and matheuristic methods for the parallel machine scheduling and location problem with delivery time and due date
Uses Software
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)
