A time-indexed LP-based approach for min-sum job-shop problems
From MaRDI portal
Publication:646647
Recommendations
- Time-Indexed Formulations for Machine Scheduling Problems: Column Generation
- Dual relaxations of the time-indexed ILP formulation for min-sum scheduling problems
- A time indexed formulation of non-preemptive single machine scheduling problems
- Time-indexed formulations and the total weighted tardiness problem
- Valid inequalities for a time-indexed formulation
Cites work
- scientific article; zbMATH DE number 2102785 (Why is no real title available?)
- A very fast TS/SA algorithm for the job shop scheduling problem
- An advanced tabu search algorithm for the job shop problem
- An alternative framework to Lagrangian relaxation approach for job shop scheduling.
- An experimental study of LP-based approximation algorithms for scheduling problems
- An improved branch-and-bound algorithm for the two machine total completion time flow shop problem
- Approximation algorithms for shop scheduling problems with minsum objective
- Combining constraint programming and local search for job-shop scheduling
- Compact vs. exponential-size LP relaxations
- Constraint propagation and problem decomposition: A preprocessing procedure for the job shop problem
- Constraint satisfaction problems: Algorithms and applications
- Constraint-based scheduling: Applying constraint programming to scheduling problems.
- Deterministic job-shop scheduling: Past, present and future
- Fifty years of scheduling: a survey of milestones
- Formulating the single machine sequencing problem with release dates as a mixed integer program
- Geometric algorithms and combinatorial optimization.
- Job Shop Scheduling by Local Search
- Job-Shop Scheduling by Implicit Enumeration
- Lagrangian bounds for just-in-time job-shop scheduling
- Parallel machine scheduling by column generation
- Scheduling algorithms
- The Shifting Bottleneck Procedure for Job Shop Scheduling
- The job shop scheduling problem: Conventional and new solution techniques
- Time-Indexed Formulations for Machine Scheduling Problems: Column Generation
- Using separation algorithms to generate mixed integer model reformulations
Cited in
(9)- Iterative aggregation and disaggregation algorithm for pseudo-polynomial network flow models with side constraints
- A noncompact formulation for job-shop scheduling problems in traffic management
- Arc flow formulations based on dynamic programming: theoretical foundations and applications
- The minimum raster set problem and its application to the \(d\)-dimensional orthogonal packing problem
- Deriving compact extended formulations via LP-based separation techniques
- Dual relaxations of the time-indexed ILP formulation for min-sum scheduling problems
- Deriving compact extended formulations via LP-based separation techniques
- A hybrid evolutionary algorithm to solve the job shop scheduling problem
- Skewed general variable neighborhood search for the location routing scheduling problem
This page was built for publication: A time-indexed LP-based approach for min-sum job-shop problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q646647)
