Scatter search with path relinking for the job shop with time lags and setup times
From MaRDI portal
Publication:337556
DOI10.1016/J.COR.2015.02.005zbMATH Open1348.90264OpenAlexW2010006159MaRDI QIDQ337556FDOQ337556
Authors: Miguel A. González, Angelo Oddi, Riccardo Rasconi, Ramiro Varela 
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2015.02.005
Recommendations
- An advanced scatter search algorithm for solving job shops with sequence dependent and non-anticipatory setups
- A scatter search approach to sequence-dependent setup times job shop scheduling
- Scatter search with path relinking for the flexible job shop scheduling problem
- Scatter search for minimizing weighted tardiness in a single machine scheduling with setups
- Job Shop Scheduling with Setup Times and Maximal Time-Lags: A Simple Constraint Programming Approach
Cites Work
- Tabu Search—Part I
- A new hybrid genetic algorithm for job shop scheduling problem
- Applying tabu search to the job-shop scheduling problem
- Title not available (Why is that?)
- Job Shop Scheduling by Simulated Annealing
- A Fast Taboo Search Algorithm for the Job Shop Problem
- Algorithms for Solving Production-Scheduling Problems
- Some aspects of scatter search in the flow-shop problem
- Permutation flowshop scheduling problems with maximal and minimal time lags
- Guided local search with shifting bottleneck for job shop scheduling
- Tabu Search—Part II
- A competent memetic algorithm for complex scheduling
- A generalized permutation approach to job shop scheduling with genetic algorithms
- A scatter search approach to sequence-dependent setup times job shop scheduling
- Job shop scheduling with setup times, deadlines and precedence constraints
- Local search and genetic algorithm for the job shop scheduling problem with sequence dependent setup times
- A very fast TS/SA algorithm for the job shop scheduling problem
- An advanced tabu search algorithm for the job shop problem
- Parallel Taboo Search Techniques for the Job Shop Scheduling Problem
- A branch and bound algorithm for a single-machine scheduling problem with positive and negative time-lags
- One-machine generalized precedence constrained scheduling problems
- Using genetic algorithms and heuristics for job shop scheduling with sequence-dependent setup times
- A branch \(\&\) bound method for the general-shop problem with sequence dependent setup-times
- A memetic algorithm for the job-shop with time-lags
- Tabu search for frequency assignment in mobile radio networks
- Combining constraint programming and local search for job-shop scheduling
- Path-relinking tabu search for the multi-objective flexible job shop scheduling problem
- Shortest path methods: A unifying approach
- Solving job shop scheduling with setup times through constraint-based iterative sampling: an experimental analysis
- A No-Wait Flowshop Scheduling Heuristic to Minimize Makespan
- An advanced scatter search algorithm for solving job shops with sequence dependent and non-anticipatory setups
- Lexicographic optimization of a permutation flow shop scheduling problem with time lag constraints
- Solution of the Flowshop-Scheduling Problem with No Intermediate Queues
- Local search algorithms for a single-machine scheduling problem with positive and negative time-lags
- A branch and bound method for the job-shop problem with sequence-dependent setup times
Cited In (8)
- A scatter search approach to sequence-dependent setup times job shop scheduling
- Title not available (Why is that?)
- Non-permutation flowshop scheduling problem with minimal and maximal time lags: theoretical study and heuristic
- Scatter search for minimizing weighted tardiness in a single machine scheduling with setups
- An advanced scatter search algorithm for solving job shops with sequence dependent and non-anticipatory setups
- Scatter search with path relinking for the flexible job shop scheduling problem
- Scatter search for the minimum leaf spanning tree problem
- Biased random-key genetic algorithm for the job sequencing and tool switching problem with non-identical parallel machines
Uses Software
This page was built for publication: Scatter search with path relinking for the job shop with time lags and setup times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q337556)
