A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem
From MaRDI portal
(Redirected from Publication:883284)
Recommendations
- A very fast TS/SA algorithm for the job shop scheduling problem
- Applying tabu search to the job-shop scheduling problem
- Improved taboo search algorithm for Job Shop scheduling problems
- An tentative taboo search algorithm for job shop scheduling
- A tabu search/path relinking algorithm to solve the job shop scheduling problem
Cites work
- scientific article; zbMATH DE number 1062113 (Why is no real title available?)
- scientific article; zbMATH DE number 1488092 (Why is no real title available?)
- A Fast Taboo Search Algorithm for the Job Shop Problem
- A branch and bound algorithm for the job-shop scheduling problem
- A genetic algorithm for the job shop problem
- A tabu search method guided by shifting bottleneck for the job shop scheduling problem
- An Algorithm for Solving the Job-Shop Problem
- An experimental analysis of local minima to improve neighbourhood search.
- Applying tabu search to the job-shop scheduling problem
- Benchmarks for shop scheduling problems
- Deterministic job-shop scheduling: Past, present and future
- Future paths for integer programming and links to artificial intelligence
- Guided local search with shifting bottleneck for job shop scheduling
- Job Shop Scheduling by Local Search
- Job Shop Scheduling by Simulated Annealing
- Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm
- New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
- Parallel Taboo Search Techniques for the Job Shop Scheduling Problem
- Tabu Search—Part I
- Tabu Search—Part II
- The Shifting Bottleneck Procedure for Job Shop Scheduling
- The job shop scheduling problem: Conventional and new solution techniques
Cited in
(29)- A hybrid multiobjective evolutionary approach for flexible job-shop scheduling problems
- An advanced tabu search algorithm for the job shop problem
- GA-ACO in Job-Shop Schedule Problem Research
- Problem difficulty for tabu search in job-shop scheduling
- An tentative taboo search algorithm for job shop scheduling
- A discrete artificial bee colony algorithm for the multi-objective flexible job-shop scheduling problem with maintenance activities
- A robust parameter design for multi-response problems
- Minimizing the expected maximum lateness for a job shop subject to stochastic machine breakdowns
- An asynchronous parallel disassembly planning based on genetic algorithm
- Improved taboo search algorithm for Job Shop scheduling problems
- An efficient tabu search neighborhood based on reconstruction strategy to solve the blocking job shop scheduling problem
- A tabu search/path relinking algorithm to solve the job shop scheduling problem
- A guided local search with iterative ejections of bottleneck operations for the job shop scheduling problem
- An extended Akers graphical method with a biased random‐key genetic algorithm for job‐shop scheduling
- A hybrid evolutionary algorithm to solve the job shop scheduling problem
- A tabu search method guided by shifting bottleneck for the job shop scheduling problem
- New and ``stronger job-shop neighbourhoods: A focus on the method of Nowicki and Smutnicki (1996)
- Deconstructing Nowicki and Smutnicki's \(i\)-TSAB tabu search algorithm for the job-shop scheduling problem
- An improved particle swarm optimization with decline disturbance index (DDPSO) for multi-objective job-shop scheduling problem
- Tabu Search Algorithm with Neural Tabu Mechanism for the Cyclic Job Shop Problem
- Hybrid genetic algorithm with multiparents crossover for job shop scheduling problems
- An effective new island model genetic algorithm for job shop scheduling problem
- Parallel-identical-machine job-shop scheduling with different stage-dependent buffering requirements
- Enhancing local search algorithms for job shops with MIN-sum objectives by approximate move evaluation
- A random neighborhood swapping algorithm for job shop scheduling problems
- A general efficient neighborhood structure framework for the job-shop and flexible job-shop scheduling problems
- Pareto-based grouping discrete harmony search algorithm for multi-objective flexible job shop scheduling
- Solving a job-shop scheduling problem based on a tabu search algorithm
- A very fast TS/SA algorithm for the job shop scheduling problem
This page was built for publication: A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q883284)
