A time-indexed LP-based approach for min-sum job-shop problems
From MaRDI portal
Publication:646647
DOI10.1007/s10479-010-0832-9zbMath1225.90053MaRDI QIDQ646647
Paolo Serafini, Giuseppe Lancia, Franca Rinaldi
Publication date: 17 November 2011
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-010-0832-9
90B35: Deterministic scheduling theory in operations research
Related Items
Deriving compact extended formulations via LP-based separation techniques, 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, The minimum raster set problem and its application to the \(d\)-dimensional orthogonal packing problem, Iterative aggregation and disaggregation algorithm for pseudo-polynomial network flow models with side constraints, Arc flow formulations based on dynamic programming: theoretical foundations and applications
Cites Work
- Unnamed Item
- Unnamed Item
- Formulating the single machine sequencing problem with release dates as a mixed integer program
- Using separation algorithms to generate mixed integer model reformulations
- The job shop scheduling problem: Conventional and new solution techniques
- Geometric algorithms and combinatorial optimization.
- Constraint-based scheduling: Applying constraint programming to scheduling problems.
- An alternative framework to Lagrangian relaxation approach for job shop scheduling.
- 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
- Compact vs. exponential-size LP relaxations
- Deterministic job-shop scheduling: Past, present and future
- Constraint satisfaction problems: Algorithms and applications
- Constraint propagation and problem decomposition: A preprocessing procedure for the job shop problem
- A very fast TS/SA algorithm for the job shop scheduling problem
- Lagrangian bounds for just-in-time job-shop scheduling
- An advanced tabu search algorithm for the job shop problem
- Parallel Machine Scheduling by Column Generation
- An Experimental Study of LP-Based Approximation Algorithms for Scheduling Problems
- Combining Constraint Programming and Local Search for Job-Shop Scheduling
- Fifty years of scheduling: a survey of milestones
- The Shifting Bottleneck Procedure for Job Shop Scheduling
- Job-Shop Scheduling by Implicit Enumeration
- Time-Indexed Formulations for Machine Scheduling Problems: Column Generation
- Job Shop Scheduling by Local Search