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.005zbMath1348.90264OpenAlexW2010006159MaRDI QIDQ337556
Angelo Oddi, Miguel A. González, Ramiro Varela, Riccardo Rasconi
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
Related Items (3)
Non-permutation flowshop scheduling problem with minimal and maximal time lags: theoretical study and heuristic ⋮ Scatter search for the minimum leaf spanning tree problem ⋮ Scatter search for minimizing weighted tardiness in a single machine scheduling with setups
Uses Software
Cites Work
- Unnamed Item
- Path-relinking tabu search for the multi-objective flexible job shop scheduling problem
- Solving job shop scheduling with setup times through constraint-based iterative sampling: an experimental analysis
- Job shop scheduling with setup times, deadlines and precedence constraints
- A branch and bound method for the job-shop problem with sequence-dependent setup times
- Local search and genetic algorithm for the job shop scheduling problem with sequence dependent setup times
- 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 new hybrid genetic algorithm for job shop scheduling problem
- A competent memetic algorithm for complex scheduling
- A generalized permutation approach to job shop scheduling with genetic algorithms
- A branch \(\&\) bound method for the general-shop problem with sequence dependent setup-times
- Applying tabu search to the job-shop scheduling problem
- A very fast TS/SA algorithm for the job shop scheduling problem
- An advanced tabu search algorithm for the job shop problem
- A memetic algorithm for the job-shop with time-lags
- Tabu search for frequency assignment in mobile radio networks
- 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
- Combining Constraint Programming and Local Search for Job-Shop Scheduling
- A scatter search approach to sequence-dependent setup times job shop scheduling
- Shortest path methods: A unifying approach
- Job Shop Scheduling by Simulated Annealing
- Tabu Search—Part I
- Tabu Search—Part II
- A No-Wait Flowshop Scheduling Heuristic to Minimize Makespan
- Parallel Taboo Search Techniques for the Job Shop Scheduling Problem
- A Fast Taboo Search Algorithm for the Job Shop Problem
- 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
- Algorithms for Solving Production-Scheduling Problems
- Local search algorithms for a single-machine scheduling problem with positive and negative time-lags
This page was built for publication: Scatter search with path relinking for the job shop with time lags and setup times
